Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
Introduction to algorithms
Planar orientations with low out-degree and compaction of adjacency matrices
Theoretical Computer Science
A fast and effective heuristic for the feedback arc set problem
Information Processing Letters
Bipolar orientations revisited
Discrete Applied Mathematics - Special issue: Fifth Franco-Japanese Days, Kyoto, October 1992
Randomized algorithms
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Tight bounds for the maximum acyclic subgraph problem
Journal of Algorithms
A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
Discrete Applied Mathematics
Algorithms for area-efficient orthogonal drawings
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
Three-dimensional orthogonal graph drawing algorithms
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the complexity of bicoloring clique hypergraphs of graphs
Journal of Algorithms
Regular Orientations, Arboricity, and Augmentation
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal three-dimensional orthogonal graph drawing in the general position model
Theoretical Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Clean the graph before you draw it!
Information Processing Letters
Fast edge searching and fast searching on graphs
Theoretical Computer Science
Hi-index | 0.05 |
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 fight 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 directed acyclic graphs, trees, and graphs with maximum degree three. For undirected graphs, we obtain a 13/8-approximation algorithm. Finally we consider the problem of determining a balanced vertex-ordering of a bipartite graph with a fixed ordering of one bipartition. When only the imbalances of the fixed vertices count, this problem is shown to be NP-hard. On the other hand, we describe an optimal linear time algorithm when the final imbalances of all vertices count. We obtain a linear time algorithm to compute an optimal vertex-ordering of a bipartite graph with one bipartition of constant size.