A Fast Multi-scale Method for Drawing Large Graphs
- 1 January 2001
- book chapter
- Published by Springer Nature
- p. 183-196
- https://doi.org/10.1007/3-540-44541-2_18
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- Drawing graphs nicely using simulated annealingACM Transactions on Graphics, 1996
- Graph drawing by force‐directed placementSoftware: Practice and Experience, 1991
- A unified approach to approximation algorithms for bottleneck problemsJournal of the ACM, 1986
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985