Interactive visualization of small world graphs

Proceedings - IEEE Symposium on Information Visualization, INFO VIS

Volumn , Issue , 2004, Pages 199-206

  Van Ham, Frank ^a   Van Wijk, Jarke J ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Graph Drawing, Clustering; Graph Visualization; Small World Graphs

Indexed keywords

CLUSTERING; GRAPH DRAWING; GRAPH VISUALIZATION; SMALL WORLD GRAPHS;

ABSTRACTING; ALGORITHMS; DATA STRUCTURES; INFORMATION ANALYSIS; SEMANTICS; VISUALIZATION;

GRAPH THEORY;

EID: 16244407398     PISSN: 1522404X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFVIS.2004.43     Document Type: Conference Paper

References (36)

1. Charles J. Alpert and Andrew B. Kahng. Recent directions in netlist partitioning: A survey. Technical report, Computer Science Department, University of California at Los Angeles, 1995.
2. D. Auber, Y. Chiricota, F. Jourdan, and G. Melançon. Multiscale visualization of small world networks. In Proc. of IEEE Symp. on Information Visualization 2003, pages 75-81. IEEE CS Press, 2003.
3. Joshua E. Barnes and Pier Hut. A hierarchical o(n log n) force calculation algorithm. In Nature, volume 324(4), pages 446-449, 1986.
4. Guiseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph drawing : Algorithms for the visualization of graphs. Prentice Hall, 1999.
5. Eric A. Bier, Maureen C. Stone, Ken Pier, William Buxton, and Tony D. DeRose. Toolglass and magic lenses: The see-through interface. Computer Graphics, 27(Annual Conference Series):73-80, 1993.
6. M. S. T. Carpendale, D. J. Cowperthwaite, F. D. Fracchia, and T. C. Shermer. Graph folding: Extending detail and context viewing into a tool for subgraph comparisons, In Franz J. Brandenburg, editor, Proc. 3rd Int. Symp. on Graph Drawing, pages 127-139. Springer-Verlag, 1995.
7. F. Chung and S. T. Yau. Eigenvalues, flows and separators of graphs. In Proc. of the 26th Annual ACM Symposium on Theory of Computing, pages 1-8, 1997.
8. P. Eades. A heuristic for graph drawing. In Congressus Numerantium, volume 42, pages 149-160, 1984.
9. K. M. Fairchild, S. E. Poltrock, and G. W. Furnas. Semnet: Three-dimensional graphic representations of largeknowledge bases. In R. Guindon, editor, Cognitive Science and Its Applications for Human Computer Interaction, pages 201-233. Lawrence Erlbaum, 1988.
10. Arne Frick, Andreas Ludwig, and Heiko Mehldau. A fast adaptive layout algorithm for undirected graphs. In Roberto Tamassia and Ioannis G. Tollis, editors, Proc. of the DIMACS Int. Workshop on Graph Drawing, pages 388-403. Springer-Verlag, 1994.
11. T. M. J. Fruchterman and E.M. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21(11):1129-1164, 1991.
12. G. W. Furnas. Generalized fisheye views. In Human Factors in Computing Systems CHI '86 Conf. Proc., pages 16-23. ACM Press, 1986.
13. P. Gajer, M. Goodrich, and S. Kobourov. A multi-dimensional approach to force-directed layouts of large graphs. In Joe Marks, editor, Proc. 8th Int. Symp. on Graph Drawing, pages 211-221. Springer-Verlag, 2000.
14. J. Han and M. Kamber. Data Mining - Concepts and Techniques. Morgan Kaufmann, 2001.
15. David Harel and Yehuda Koren. A fast multi-scale method for drawing large graphs. In Graph Drawing: 8th International Symposium (GD'00), pages 183-196, 2000.
16. Ivan Herman, Guy Melançon, and M. Scott Marshall. Graph visualization and navigation in information visualization, volume 6(1), pages 24-43, 2000.
17. M. L. Huang and P. Eades. A fully interactive system for clustering and navigating large graphs. In S. Whitesides, editor, Proc. 6th Int. Symp. on Graph Drawing, pages 374-383. Springer-Verlag, 1998.
18. J. Lamping, R. Rao, and P. Pirolli. A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In Human Factors in Computing Systems CHI '95 Conf. Proc, pages 401-408. ACM Press, 1995.
19. Y. K. Leung and M. D. Apperley. A review and taxonomy of distortion-oriented presentation techniques. ACM Transactions on Computer-Human Interaction, 1(2):126-160, 1994.
20. S. Milgram. The small world problem. Psychology Today, 2:60-67, 1967.
21. T. Munzner. H3: Laying out large directed graphs in 3d hyperbolic space. In Proc. of IEEE Symp. on Information Visualization 1997, pages 2-10. IEEE CS Press, 1997.
22. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113, 2004.
23. M.E.J. Newman. Fast algorithm for detecting community structure in networks. Phys. Rev. E (in press), 2004.
24. A. Noack. An energy model for visual graph clustering. In Proc. 11th Int. Symp. on Graph Drawing, pages 425-436. Springer-Verlag, 2003.
25. Phaidon. The ART Book. Phaidon Press Limited, London, 1994.
26. Aaron Quigley and Peter Eades. Graph drawing, clustering, and visual abstraction. In Joe Marks, editor, Proc. 8th Int. Symp. Graph Drawing, pages 197-210. Springer LNCS 1984, 2000.
27. Tom Roxborough and Arunabha Sen. Graph clustering using multiway ratio cut. In Giuseppe Di Battista, editor, Proc. 5th Int. Symp. on Graph Drawing, pages 291-296. Springer-Verlag, 1997.
28. Manojit Sarkar and Marc H. Brown. Graphical fisheye views of graphs. In Human Factors in Computing Systems CHI '92 Conf. Proc., pages 83-91. ACM Press, 1992.
29. Doug Schaffer, Zhengping Zuo, Saul Greenberg, Lyn Bartram, John Dill, Shelli Dubs, and Mark Roseman. Navigating hierarchically clustered networks through fisheye and full-zoom methods. ACM Transactions on Computer-Human Interaction, 3(2):162-188, 1996.
30. T. C. Sprenger, R. Brunella, and M. H. Gross. H-blob: A hierarchical visual clustering method using implicit surfaces. In Proc. of IEEE Visualization, pages 61-68. IEEE CS Press, 2000.
31. M. D. Storey, F. D. Fracchia, and H. A. Muller. Customizing a fisheye view algorithm to preserve the mental map. Journal of Visual Languages and Computing, 10(3):245-267, 1999.
32. Stijn van Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2001.
33. Robert van Liere and Wim de Leeuw. Graphsplatting: Visualizing graphs as continuous fields. In IEEE Transactions on Visualization and Computer Graphics, volume 9(2), pages 206-212, 2003.
34. C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Joe Marks, editor, Proc. 8th Int. Symp. Graph Drawing, pages 171-182. Springer-Verlag, 2000.
35. D. J. Watts and S.H. Strogatz. Collective dynamics of 'small-world' networks. Nature 393, pages 440-442, 1998.
36. J. A. Wise, J. J. Thomas, K. Pennock, and D. L. Lantrip. Visualizing the non-visual: Spatial analysis and interaction with information from text documents. In S.K. Card, J.D. Mackinlay, and B. Shneiderman, editors, Readings in Information Visualization, pages 442-250. Morgan Kaufmann Publishers, 1999.