Balanced vertex-orderings of graphs

  title={Balanced vertex-orderings of graphs},
  author={Therese C. Biedl and Timothy M. Chan and Yashar Ganjali and Mohammad Taghi Hajiaghayi and David R. Wood},
  journal={Discrete Applied Mathematics},
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as possible. This problem, which has applications in graph drawing for example, is shown to be NP-hard, and remains NP-hard for bipartite simple graphs with maximum degree six. We then describe and analyze a number of methods for determining a balanced vertex-ordering, obtaining optimal orderings for… CONTINUE READING

From This Paper

Topics from this paper.
17 Citations
44 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 44 references

On the complexity of the balanced vertex ordering

  • Jan Kára, Jan Kratochv́ıl, David R. Wood
  • 2004
1 Excerpt

On the complexity of the balanced vertex ordering problem

  • Richard M. Karp
  • 2004

Balanced vertex-orderings of graphs

  • Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammad- Taghi Hajiaghayi, David R. Wood
  • Tech. Rep. TR-2002-01,
  • 2002
1 Excerpt

Eager st - ordering

  • Joseph Cheriyan, John H. Reif
  • Proc . 10 th Annual European Symp . on Algorithms…
  • 2002

On the complexity of bicoloring clique hypergraphs of graphs

  • Jan Kratochv́ıl, Zsolt Tuza
  • J. Algorithms,
  • 2002
1 Excerpt

lis. The three-phase method: A unified approach to orthogonal graph drawing

  • Therese C. Biedl, Brendan P. Madden, Ioannis G. Tol
  • International J. Comp. Geometry Appl.,
  • 2000
2 Excerpts

Similar Papers

Loading similar papers…