Centrality based visualization of small world graphs

Computer Graphics Forum

Volumn 27, Issue 3, 2008, Pages 975-982

  Van Ham, F ^a   Wattenberg, M ^a  

^a IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPHIC METHODS;

BREAK DOWN; GRAPH DRAWING ALGORITHMS; LOW DIAMETERS; NODE-LINK DIAGRAMS; REAL-WORLD; SMALL WORLD GRAPHS; SMALL WORLDS;

GRAPH THEORY;

EID: 53149146319     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2008.01232.x     Document Type: Article

References (23)

1. Auber D., Chiricota Y., Jourdan F., Melançon G. : Multi-scale visualization of small world networks. In Proceedings of the 2003 IEEE Symposium on Information Visualization (2003 pp. 75 81.
2. Anthonisse J. : The rush in a directed graph, Technical Report BN 9/71. Tech. rep., Stichting Mathematisch Centrum, Amsterdam, 1971.
3. Brandes U., Pich C. : Centrality estimation in large networks. International Journal of Bifurcation and Chaos 17, 7 (2007 2303 2318.
4. Brandes U. : A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25, 2 (2001 163 177.
5. Chen C., Morris S. : Visualizing evolving networks: Minimum spanning trees versus pathfinder networks. In Proceedings of the 2003 IEEE Symposium on Information Visualization (2003 pp. 67 74.
6. Freeman L. : A set of measures of centrality based on betweenness. Sociometry 40 (1997 35 41.
7. Ghoniem M., Fekete J.-D., Castagliola P. : A comparison of the readability of graphs using node-link and matrix-based representations. In Proceedings of the 2004 IEEE Symposium on Information Visualization (2004 pp. 17 24.
8. Hachul S., Jünger M. : An experimental comparison of fast algorithms for drawing large general graphs". In Proceedings Graph Drawing 2005 (GD'05) (2005 pp. 235 250.
9. Holten D. : Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics 12, 5 (2006 741 748.
10. Hopcroft J., Tarjan R. : Efficient planarity testing. Journal of the ACM (JACM) 21, 4 (1974 549 568.
11. Jünger M., Mutzel P. : Maximum planar subgraphs and nice embeddings: Practical layout tools. Algo-rithmica 162 (1996 33 59.
12. Kim D.-H., Noh J.-D., Jeong H. : Scale-free trees: The skeletons of complex networks. Phys. Rev. E 70, 046126 (2004).
13. Liebers A. : Planarizing graphs. JGAA 5, 1 (2001 1 74.
14. Love M. : Genealogy of influence, 2007. http://mike-love.net/, accessed March 2007.
15. Newman M., Girvan M. : Finding and evaluating cluster structure in networks. Phys. Rev. E69 026113 (2004).
16. Noack A. : Energy-based clustering of graphs with nonuniform degrees. In Proceedings Graph Drawing 2005 (2005 pp. 309 320.
17. Phan D., Xiao L., Yeh R., Hanrahan P., Winograd T. : Flow map layout. In Proceedings of the 2005 IEEE Symposium on Information Visualization (2005 pp. 219 224.
18. Schvaneveldt R., Durso F., Dearholt D. : Network structures in proximity data. The psychology of learning and motivation: Advances in research and theory 24 (1989 249 284.
19. van Dongen S. : Graph Clustering by Flow Simulation. PhD thesis, Universiteit Utrecht, 2000.
20. van Ham F. : Using multilevel call matrices in large software projects. In Proceedings of the 2003 IEEE Symposium on Information Visualization (2003 pp. 227 232.
21. van Ham F., van Wijk J. : Interactive visualization of small world graphs. In Proceedings of the 2004 IEEE Symposium on Information Visualization (2004 pp. 199 206.
22. Wilkinson D., Huberman B. : A method for finding communities of related genes. Proceedings of the National Academy of Sciences (PNAS) 101, 1 (2004 5241 5248.
23. Watts D., Strogatz S. : Collective dynamics of 'small-world' networks. Nature 393 (1998 440 442.