Hardness of approximate compaction for nonplanar orthogonal graph drawings

Authors:
Michael J. Bannister;David Eppstein
Affiliations:
Computer Science Department, University of California, Irvine;Computer Science Department, University of California, Irvine
Venue:
GD'11 Proceedings of the 19th international conference on Graph Drawing
Year:
2011

Citing 7
Cited 0

On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
Turn-regularity and optimal area drawings of orthogonal representations

Computational Geometry: Theory and Applications
Orthogonal graph drawing

Drawing graphs
On the complexity of orthogonal compaction

Computational Geometry: Theory and Applications
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing

Graph Drawing
Complexity of finding non-planar rectilinear drawings of graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
On rectilinear drawing of graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows or the minimum possible area cannot be approximated to within better than a polynomial factor in polynomial time unless P=NP. However, there is a fixed-parameter-tractable algorithm for testing whether a drawing can be compacted to a given number of rows.