Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Algorithms for area-efficient orthogonal drawings
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
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
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Imbalance is fixed parameter tractable
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Imbalance is fixed parameter tractable
Information Processing Letters
Hi-index | 0.00 |
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference between the number of neighbours to the left and right of v. This problem, which has applications in graph drawing, was recently introduced by Biedletal. [1]. They proved that the problem is solvable in polynomial time for graphs with maximum degree three, but $\mathcal{NP}$-hard for graphs with maximum degree six. One of our main results is closing the gap in these results, by proving $\mathcal{NP}$-hardness for graphs with maximum degree four. Furthermore, we prove that the problem remains $\mathcal{NP}$-hard for planar graphs with maximum degree six and for 5-regular graphs. On the other hand we present a polynomial time algorithm that determines whether there is a vertex ordering with total imbalance smaller than a fixed constant, and a polynomial time algorithm that determines whether a given multigraph with even degrees has an ‘almost balanced’ ordering.