FADE: Graph drawing, clustering, and visual abstraction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 197-210

  Quigley, Aaron ^a   Eades, Peter ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; CLUSTERING ALGORITHMS; DRAWING (GRAPHICS); GRAPH THEORY;

DECOMPOSITION TREES; FORCE DIRECTED ALGORITHMS; GEOMETRIC CLUSTERING; HIER-ARCHICAL CLUSTERING; HIERARCHICAL SPACE DECOMPOSITION; LEVEL OF ABSTRACTION; LEVELS OF ABSTRACTION; REGULAR DECOMPOSITION;

TREES (MATHEMATICS);

EID: 84958535557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_19     Document Type: Conference Paper

References (39)

1. Richard J. Anderson, Tree data structures and n-body simulation, SIAM J. Comput. 28 (1999), no. 6, 1923-1940.
2. J. Barnes and P. Hut, A hierarchical o(n log n) force-calculation algorithm, Nature 324 (1986), no. 4, 446-449.
3. Francois Bertault, A force-directed algorithm that preserves edge crossing properties, Seventh International Symposium on Graph Drawing (Prague, Chezh Republic) (Jan Kratochvíl, ed.), Springer, September 1999, pp. 351-358.
4. G. Blellcoh and G. Narlikar, A practical comparison of n-body algorithms, Technical report, Wright Laboratory, 1991.
5. Peter Eades, A heuristic for graph drawing, Congresses Numerantium 42 (1984), 149-160.
6. G. Erhard, Advances in system analysis vol. 4, graphs as structural models: The application of graphs and multigraphs in cluster analysis, Vieweg, 1988.
7. Q.W. Feng., Algorithms for drawing clustered graphs, Ph.D. thesis, The University of Newcastle, Australia, 1997.
8. T. Fruchterman and E. Reingold, Graph drawing by force-directed placement, Software-Practice and Experience 21 (1991), no. 11, 1129-1164.
9. Roberto Tamassia, G. Di Battista, P. Eades and I. G. Tollis, Graph drawing, algorithms for the visualization of graphs, Prentice-Hall Inc., 1999.
10. R. Hadany and David Harel, A multi-scale method for drawing graphs nicely, 25th International Workshop on Graph-Theoretic Concepts in Computer Science, 1999.
11. David Harel and Yehuda Koren, A fast multi-scale method for drawing large graphs, Technical report, Dept. of Applied Mathematics and Computer Science, Weizmann Institute, Rehovot, Israel, November 1999.
12. J. Hartigan, Clustering algorithms, Wiley, 1975.
13. W. He and K. Marriott, Constrained graph layout, Symposium on Graph Drawing, GD '96 (Stephen North, ed.), vol. 1190 of Lecture notes in Computer Science, Springer, 1996, pp. 217-232.
14. L. Hernquist, Hierarchical n-body methods, Computational Physics Communications 48 (1988), 107-115.
15. R. W. Hockney and P. M. Sloot, Computer simulations using particles, McGraw- Hill, 1981.
16. Mao Huang, On-line animated visualization of huge graphs, Ph.D. thesis, The University of Newcastle, Australia, 1999.
17. Maurice M. de Ruiter, Ivan Herman, Guy Melançon and Maylis Delest, Latour - a tree visualisation system, Seventh International Symposium on Graph Drawing (Prague, Chezh Republic) (Jan Kratochvíl, ed.), Springer, September 1999, pp. 392-399.
18. L. Greengard, J. Carriert and V. Rokhlin, A fast adaptive multipole algorithm for particle simulations, SIAM Journal on Scientific Computing 9 (1988), no. 4, 669-686.
19. Arunabha Sen, Jubin Edachery and Franz J. Brandenburg, Graph clustering using distance-k cliques, 7th International Symposium on Graph Drawing, GD '99 (Jan Kratochvíl, ed.), vol. 1731 of Lecture notes in Computer Science, Springer, 1999, pp. 98-106.
20. P. Eades, K. Misue, et al, Layout adjustment and the mental map, Journal of Visual Languages and Computing (1995), 183-210.
21. George Karypis and Vipin Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM Journal on Scientific Computing (1998).
22. George Karypis and Vipin Kumar, A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, Journal of Parallel and Distributed Computing (1998).
23. B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, The Bell System Techinical Journal (1970).
24. M. Lorr, Cluster analysis for social scientists, Jossey-Bass Ltd., 1987.
25. Susanne Pfalzner and Paul Gibbon, Many-body tree methods in physics, Cambridge University Press, 1996.
26. R. Cohen, Q. W. Feng and P. Eades, How to draw a planer clustered graph, CO- COON, vol. 959, Lecture notes in Computer Science, Springer, 1995, pp. 21-31.
27. Reinhard Sablowski and Arne Frick, Automatic graph clustering (system demonstration), Symposium on Graph Drawing, GD '96 (Stephen North, ed.), vol. 1190 of Lecture notes in Computer Science, Springer, 1996, pp. 395-400.
28. Manojit Sarkar and Marc Brown, Graphical fisheye views of graphs, ACM SIGCHI '92 Conference on Human Factors in Computing Systems, March 1992.
29. Horst Simon and Shang-Hua Teng, How good is recursive bisection, Nasa - publication, Ames Research Center NASA, June 1993.
30. H. Spath, Cluster analysis algorithms for data reduction and classification of objects, Horwood, 1980.
31. K. Sugiyama and K. Misue, A simple and unified method for drawing graphs: Magnetic-spring algorithm, Proceedings of Graph Drawing, GD '94 (Roberto Ta- massia and Ioannis Tollis, eds.), vol. 894 of Lecture Notes in Computer Science, Springer, 1995, pp. 364-375.
32. S. Teng, Points, spheres, and separators: A unified geometric approach to graph partitioning, Ph.D. thesis, School of Computer Science, Carnegir Mellon University, 1991.
33. Edward R. Tufte, The visual display of quatitative information, Graphics Press, 1983.
34. Edward R. Tufte, Envisioning information, Graphics Press, 1990.
35. Edward R. Tufte, Visual explanations, Graphics Press, 1997.
36. Daniel Tunkelang, Jiggle: Java interactive general graph layout environment, Sixth International Symposium on Graph Drawing (McGill University, Canada) (Sue Whitesides, ed.), Springer, August 1998.
37. Andrej Mrvar, Vladimir Batagelj and Matjaz Zaveršnik, Partitioning approach to visualization of large graphs, 7th International Symposium on Graph Drawing, GD '99 (Jan Kratochvíl, ed.), vol. 1731 of Lecture notes in Computer Science, Springer, 1999, pp. 90-97.
38. Jiong Yang, Wei Wang and Richard Muntz, Sting: A statistical information grid approach to spatial data mining, 23rd International Conference on Very Large Data Bases(VLDB), IEEE, 1997, pp. 186-195.
39. Jiong Yang, Wei Wang and Richard Muntz, Sting+: An approach to active spatial data mining, IEEE, 1999, pp. 116-125.