On the visualization of social and other scale-free networks

IEEE Transactions on Visualization and Computer Graphics

Volumn 14, Issue 6, 2008, Pages 1285-1292

  Jia, Yuntao ^a   Hoberock, Jared ^a   Garland, Michael ^b   Hart, John C ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b NVIDIA   (United States)

Author keywords

Anisotropic shading; Betweenness centrality; Edge filtering; Scale free network

Indexed keywords

ANISOTROPIC SHADING; ANISOTROPIC SHADINGS; BETWEENNESS CENTRALITY; CLUSTERING; EDGE FILTERING; FILTERING; LARGE POWERS; NOVEL METHODS; QUANTITATIVE ANALYSES; SCALE-FREE; SCALE-FREE NETWORK; SCALE-FREE NETWORKS; SOCIAL NETWORKS;

ANISOTROPY; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; GRAPH THEORY; GRAPHIC METHODS; INFORMATION THEORY; NETWORK PROTOCOLS; SENSOR NETWORKS; VISUALIZATION;

COMPUTER NETWORKS;

ALGORITHM; ARTICLE; COMPUTER GRAPHICS; COMPUTER INTERFACE; COMPUTER SIMULATION; INFORMATION RETRIEVAL; METHODOLOGY; SOCIAL SUPPORT; THEORETICAL MODEL;

ALGORITHMS; COMPUTER GRAPHICS; COMPUTER SIMULATION; INFORMATION STORAGE AND RETRIEVAL; MODELS, THEORETICAL; SOCIAL SUPPORT; USER-COMPUTER INTERFACE;

EID: 54949147226     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2008.151     Document Type: Conference Paper

References (32)

1. D. Archambault, T. Munzner. and D. Auber. Topolayout: Multilevel graph layout by topological features. IEEE Transactions on Visualization and Computer Graphics. 13(2):305-317, 2007.
2. D. Auber, Y. Chiricota. F. Jourdan, and G. Melancon. Multiscale visualization of small world networks. In IEEE Symposition on Information Visualisation, pages 75-81, 2003.
3. D. A. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating Betweenness Centrality, pages 124-137, Springer. 2007.
4. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509, 1999.
5. V. Boginski, S. Butenko, and P. M. Pardalos. Statistical analysis of financial networks. Computational Statistics & Data Analysis, 48:431-443, 2005.
6. F. Boutin, J. Thièvre, and M. Hascoët. Focus-based filtering + clustering technique for power-law networks with small world phenomenon, volume 6060, page 60600Q. SPIE, 2006.
7. U. Brandes. A faster algorithm for betweenness centrality. J. Math. Soc., 25(2): 163-177, 2001.
8. U. Brandes. On variants of shortest-path betweenness centrality and their generic computation. In review: Social Networks. 2007.
9. U. Brandes, M. Gaertler, and D. Wagner. Experiments on Graph Clustering Algorithms. Springer Berlin / Heidelberg. 2003.
10. U. Brandes and C. Pich. Centrality estimation in large networks. Intl. J. Bifurcation & Chaos, 17(7):2303-2318, 2007.
11. Y. Chiricota, F. Jourdan, and G. Melancon. Software components capture using graph clustering. In Program Comprehension, 2003, 11th IEEE International Workshop on, pages 217-226. 2003.
12. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics. 15(4):301-331, 1996.
13. P. A. Eades. A heuristic for graph drawing. In Congressus Numerantium, volume 42, pages 149-160, 1984.
14. L. C. Freeman. A set of measures of centrality based upon betweenness. Sociometry, 40(1):35-41, 1977.
15. A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In GD '94: Proceedings of the DIMACS International Workshop on Graph Drawing, number 894, pages 388-403, 1994.
16. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21(11):1129-1164, 1991.
17. P. Gajer and S. G. Kobourov. GRIP: Graph dRawing with intelligent placement. In GD '00: Proceedings of the 8th International Symposium on Graph Drawing, pages 222-228, 2000.
18. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences. 99(12):7821-7826, 2002.
19. S. Hachul and M. Jünger. Drawing large graphs with a potential-field-based multilevel algorithm. In Graph Drawing, pages 285-295, 2004.
20. R. Jacob. D. Koschutzki, K. A. Lehmann, L. Peeters, and D. Tenfelse-Podehl. Algorithms for Centrality Indices, pages 62-82. Springer, 2005.
21. J. T. Kajiya and T. L. Kay. Rendering fur with three dimensional textures. SIGGRAPH Comput. Graph., 23(3):271-280, 1989.
22. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inf. Process. Lett., 31(1):7-15, 1989.
23. Y. Koren, L. Carmel, and D. Harel. Drawing huge graphs by algebraic multigrid optimization. Multiscale Modeling & Simulation. 1(4):645-673, 2003.
24. G. Kumar and M. Garland. Visual exploration of complex time-varying graphs. IEEE Transactions on Visualization and Computer Graphics. 12(5):805-812, 2006.
25. B. Lee, C. S. Parr, C. Plaisant, B. B. Bederson, V. D. Veksler, W. D. Gray, and C. Kotfila. Treeplus: Interactive exploration of networks with enhanced tree layouts. IEEE Transactions on Visualization and Computer Graphics, 12(6): 1414-1426, 2006.
26. J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 631-636, 2006.
27. M. E. J. Newman. Detecting community structure in networks. European Physical Journal, B 38:321-330, 2004.
28. D. Peleg and A. A. Schafter. Graph spanners. J. Graph Theory, 13(1):99-116, 1989.
29. D. Rafiei and S. Curial. Effectively visualizing large networks through sampling. In IEEE Visualization, page 48, 2005.
30. E. Reinhard. Parameter estimation for photographic tone reproduction. J. Graph. Tools, 7(1):45-52, 2002.
31. S. White and P. Smyth. Algorithms for estimating relative importance in networks. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 266-275, 2003.
32. A. Y. Wu, M. Garland, and J. Han. Mining scale-free networks using geodesic clustering. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 719-724, 2004.