An experimental comparison of four graph drawing algorithms
- 1 April 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 7 (5-6) , 303-325
- https://doi.org/10.1016/s0925-7721(96)00005-3
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- Drawing graphs nicely using simulated annealingACM Transactions on Graphics, 1996
- Maximum planar subgraphs and nice embeddings: Practical layout toolsAlgorithmica, 1996
- Exact and heuristic algorithms for 2-layer straightline crossing minimizationPublished by Springer Nature ,1996
- A linear-time algorithm for drawing a planar graph on a gridInformation Processing Letters, 1995
- Parametric graph drawingIEEE Transactions on Software Engineering, 1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- A node‐positioning algorithm for general treesSoftware: Practice and Experience, 1990
- DAG—a program that draws directed graphsSoftware: Practice and Experience, 1988
- Automatic graph drawing and readability of diagramsIEEE Transactions on Systems, Man, and Cybernetics, 1988