Open AccessOrthogonal-Ordering Constraints are Tough
Author(s) -
Ulrik Brandes,
Barbara Pampel
Publication year - 2012
Publication title -
journal of graph algorithms and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00281
Subject(s) - computer science , algorithm , mathematical optimization , mathematics
We show that rectilinear graph drawing, the core problem of bendminimum orthogonal graph drawing, and uniform edge-length drawing, the core problem of force-directed placement, are NP-hard even for embedded paths if subjected to orthogonal-ordering constraints.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom