A multi-scale algorithm for drawing graphs nicely
- 1 September 2001
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 113 (1) , 3-21
- https://doi.org/10.1016/s0166-218x(00)00389-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- All pairs shortest paths in weighted directed graphs-exact and almost exact algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A fast multi-scale method for drawing large graphsPublished by Association for Computing Machinery (ACM) ,2000
- Drawing graphs nicely using simulated annealingACM Transactions on Graphics, 1996
- Randomized Graph Drawing with Heavy-Duty PreprocessingJournal of Visual Languages & Computing, 1995
- Multigrid methods in lattice field computationsNuclear Physics B - Proceedings Supplements, 1992
- Graph drawing by force‐directed placementSoftware: Practice and Experience, 1991
- Multilevel computations of integral transforms and particle interactions with oscillatory kernelsComputer Physics Communications, 1991
- How to Draw a GraphProceedings of the London Mathematical Society, 1963