Spirality and Optimal Orthogonal Drawings
- 1 December 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (6), 1764-1811
- https://doi.org/10.1137/s0097539794262847
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Two graph algorithms derivedActa Informatica, 1999
- Spirality and Optimal Orthogonal DrawingsSIAM Journal on Computing, 1998
- On-Line Planarity TestingSIAM Journal on Computing, 1996
- HOW TO DRAW A SERIES-PARALLEL DIGRAPHInternational Journal of Computational Geometry & Applications, 1994
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- Recognizing visibility graphs of spiral polygonsJournal of Algorithms, 1990
- On minimal‐node‐cost planar embeddingsNetworks, 1984
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- Efficient Planarity TestingJournal of the ACM, 1974
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961