A better heuristic for orthogonal graph drawings
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)Published by Springer Nature ,1993
- Drawing planar graphs using the lmc-orderingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Lower bounds for planar orthogonal drawings of graphsInformation Processing Letters, 1991
- On Embedding a Graph in the Grid with the Minimum Number of BendsSIAM Journal on Computing, 1987
- Two algorithms for maintaining order in a listPublished by Association for Computing Machinery (ACM) ,1987
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- On minimal‐node‐cost planar embeddingsNetworks, 1984
- Computing an st-numberingTheoretical Computer Science, 1976
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973