Skip to Main content Skip to Navigation
Journal articles

On the complexity of the balanced vertex ordering problem

Abstract : 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 Biedl et al. [Discrete Applied Math. 148:27―48, 2005]. They proved that the problem is solvable in polynomial time for graphs with maximum degree three, but NP-hard for graphs with maximum degree six. One of our main results is to close the gap in these results, by proving NP-hardness for graphs with maximum degree four. Furthermore, we prove that the problem remains NP-hard for planar graphs with maximum degree four and for 5-regular graphs. On the other hand, we introduce a polynomial time algorithm that determines whetherthere 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-00966505
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 26, 2014 - 4:59:22 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Thursday, June 26, 2014 - 11:55:33 AM

File

503-2521-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00966505, version 1

Collections

Citation

Jan Kára, Jan Kratochvil, David R. Wood. On the complexity of the balanced vertex ordering problem. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (1), pp.193--202. ⟨hal-00966505⟩

Share

Metrics

Record views

198

Files downloads

1066