Fixed edge-length graph drawing is NP-hard
Discrete Applied Mathematics
Using constraints to achieve stability in automatic graph layout algorithms
CHI '90 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Line Simplification with Restricted Orientations
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Mental map preserving graph drawing using simulated annealing
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Trees with convex faces and optimal angles
GD'06 Proceedings of the 14th international conference on Graph drawing
Path simplification for metro map layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Stress majorization with orthogonal ordering constraints
GD'05 Proceedings of the 13th international conference on Graph Drawing
A mixed-integer program for drawing high-quality metro maps
GD'05 Proceedings of the 13th international conference on Graph Drawing
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On d-regular schematization of embedded paths
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Automatic generation of route sketches
GD'10 Proceedings of the 18th international conference on Graph drawing
Path schematization for route sketches
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On d-regular schematization of embedded paths
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
There are several scenarios in which a given drawing of a graph is to be modified subject to preservation constraints. Examples include shape simplification, sketch-based, and dynamic graph layout. While the orthogonal ordering of vertices is a natural and frequently called for preservation constraint, we show that, unfortunately, it results in severe algorithmic difficulties even for the simplest graphs. More precisely, we show that orthogonal-order preserving rectilinear and uniform edge length drawing is ${\mathcal NP}$-hard even for paths.