摘要: … a fast algorithm for the drawing of large undirected graphs based on the force directed … This graph theoretic clustering is then used in a force directed algorithm that improves the relation …
core.ac.uk
springer.com
acm.org 
sci-hub.se 参考文章(36)
Shang-Hua Teng, Points, spheres, and separators: a unified geometric approach to graph partitioning Carnegie Mellon University. ,(1992)
Reinhard Sablowski, Arne Frick, Automatic graph clustering (system demonstration) graph drawing. pp. 395- 400 ,(1996) , 10.1007/3-540-62495-3_63
Reinhard Sablowski, Arne Frick, Automatic Graph Clustering graph drawing. pp. 395- 400 ,(1996)
Guy E. Blelloch, Girija J. Narlikar, A Practical Comparison of N-Body Algorithms Parallel Algorithms. pp. 81- 96 ,(1994)
Vladimir Batagelj, Andrej Mrvar, Matjaž Zaveršnik, Partitioning Approach to Visualization of Large Graphs graph drawing. pp. 90- 97 ,(1999) , 10.1007/3-540-46648-7_9
Maurice Lorr, Cluster analysis for social scientists ,(1938)
Ivan Herman, Guy Melançon, Maurice M. de Ruiter, Maylis Delest, Latour - a tree visualisation system graph drawing. pp. 392- 399 ,(1999) , 10.1007/3-540-46648-7_40
François Bertault, A Force-Directed Algorithm that Preserves Edge Crossing Properties graph drawing. pp. 351- 358 ,(1999) , 10.1007/3-540-46648-7_36
Kozo Sugiyama, Kazuo Misue, A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm graph drawing. pp. 364- 375 ,(1994) , 10.1007/3-540-58950-3_391
Daniel Tunkelang, JIGGLE: Java Interactive Graph Layout Environment graph drawing. pp. 412- 422 ,(1998) , 10.1007/3-540-37623-2_33