You can manage bookmarks using lists, please log in to your user account for this.
Media type:
Text;
E-Article
Title:
Orthogonal-Ordering Constraints are Tough
Contributor:
Brandes, Ulrik
[Author];
Pampel, Barbara
[Author]
Published:
KOPS - The Institutional Repository of the University of Konstanz, 2013
Published in:Journal of Graph Algorithms and Applications. 2013, 17(1), pp. 1-10. ISSN 1526-1719. Available under: doi:10.7155/jgaa.00281
Language:
English
DOI:
https://doi.org/10.7155/jgaa.00281
Origination:
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
We show that rectilinear graph drawing, the core problem of bend-minimum 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. ; published ; published