A better heuristic for orthogonal graph drawings
- 28 February 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 9 (3) , 159-180
- https://doi.org/10.1016/s0925-7721(97)00026-6
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- An experimental comparison of four graph drawing algorithmsComputational Geometry, 1997
- Drawing planar graphs using the canonical orderingAlgorithmica, 1996
- Portable graph layout and editingPublished by Springer Nature ,1996
- Drawing high degree graphs with low bend numbersPublished by Springer Nature ,1996
- New lower bounds for orthogonal graph drawingsPublished by Springer Nature ,1996
- Drawing graphs on rectangular gridsDiscrete Applied Mathematics, 1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- Combinatorial Algorithms for Integrated circuit Layout by T. Lengauer John Wiley and Sons, Chichester (UK), 1990, xxviii + 286 PP. (£35)Robotica, 1991
- On minimal‐node‐cost planar embeddingsNetworks, 1984
- Computing an st-numberingTheoretical Computer Science, 1976