Brandes, Ulrik; Pampel, Barbara Orthogonal-ordering constraints are tough. (English) Zbl 1256.05156 J. Graph Algorithms Appl. 17, No. 1, 1-10 (2013). Summary: 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 \(\mathcal {NP}\)-hard even for embedded paths if subjected to orthogonal-ordering constraints. Cited in 1 Document MSC: 05C62 Graph representations (geometric and intersection representations, etc.) 68R10 Graph theory (including graph drawing) in computer science Keywords:rectilinear graph drawing; bend-minimum orthogonal graph drawing PDFBibTeX XMLCite \textit{U. Brandes} and \textit{B. Pampel}, J. Graph Algorithms Appl. 17, No. 1, 1--10 (2013; Zbl 1256.05156) Full Text: DOI