Orthogonal-Ordering Constraints are Tough

@article{Brandes2013OrthogonalOrderingCA,
  title={Orthogonal-Ordering Constraints are Tough},
  author={Ulrik Brandes and Barbara Pampel},
  journal={J. Graph Algorithms Appl.},
  year={2013},
  volume={17},
  pages={1-10}
}
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. 

Topics from this paper.

Similar Papers

Loading similar papers…