Logo

Login | Create Account

LunarVis - Analytic Visualizations of Large Graphs

Görke, Robert and Gaertler, Marco and Wagner, Dorothea (2008) LunarVis - Analytic Visualizations of Large Graphs. [Conference Paper]

Full text not available from this repository.

Abstract

The analysis and the exploration of complex networks nowadays involves the identification of a multitude of analytic properties that have been ascertained to constitute crucial characteristics of networks. We propose a new layout paradigm for drawing large networks, with a focus on decompositional properties. The visualization is based on the general shape of an annulus and supports the immediate recognition of a large number of abstract features of the decomposition while drawing all elements. Our layouts offer remarkable readability of the decompositional connectivity and are capable of revealing subtle structural traits.

Item Type:Conference Paper
Classifications:S Software and Systems > S.001 General
ID Code:851
Deposited By:GDEA, Administration
Deposited On:24 Jun 2008
Last Modified:18 Sep 2008 13:09
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=4875&spage=352

Repository Staff Only: item control page

References

1. Pastor-Satorras, R., Vespignani, A.: Evolution and Structure of the Internet: A Statistical Physics Approach. Cambridge University Press, NY, USA (2004)

2. Chen, Q., Chang, H., Govindan, R., Jamin, S.: The origin of power laws in internet topologies revisited. In: Proceedings of INFOCOM 2002. Volume 2., IEEE 608-617

3. Wuchty, S., Almaas, E.: Peeling the yeast protein network. Proteomics 5(2) (February 2005) 444-449

4. Jeong, H., Mason, S.P., Barabási, A.L., Oltvai, Z.N.: Lethality and Centrality in Protein Networks. Nature 411 (2001) Brief communications.

5. Ducheneaut, N., Yee, N., Nickell, E., Moore, R.J.: "Alone Together?": Exploring the Social Dynamics of Massively Multiplayer Online Games. In: CHI '06: Proceedings of the SIGCHI conference on Human Factors in computing systems, New York, NY, USA, ACM Press (2006) 407-416

6. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD '05: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, New York, NY, USA, ACM Press (2005) 177-187

7. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286 (1999) 509-512

8. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(066111) (2004)

9. Brandes, U., Erlebach, T., eds.: Network Analysis: Methodological Foundations. Volume 3418 of Lecture Notes in Computer Science. Springer (2005)

10. Ware, C.: Information visualization: perception for design. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2000)

11. Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS Graph in 2.5 Dimensions. In: Proceedings of the 12th International Symposium on Graph Drawing (GD'04). Volume 3383 of Lecture Notes in Computer Science., Springer-Verlag (January 2005) 43-48

12. Alvarez-Hamelin, J.I., Dall'Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS. (2005)

13. Seidman, S.B.: Network Structure and Minimum Degree. Social Networks 5 (1983) 269-287

14. Freeman, L.C.: A Set of Measures of Centrality Based Upon Betweeness. Sociometry 40 (1977) 35-41

15. Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: 6th Workshop on Algorithm Engineering and Experiments. (2004) 100-111

16. Fruchterman, T.M.J., Reingold, E.M.: Graph Drawing by Force-directed Placement. Software - Practice and Experience 21(11) (1991) 1129-1164

17. Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In Tamassia, R., Tollis, I.G., eds.: Proc. DIMACS Int. Work. Graph Drawing, GD. Number 894, Germany, Springer-Verlag (10-12 1994) 388-403

18. Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15(4) (1996) 301-331

19. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)

20. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An Approach to Universal Topology Generation. In: Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Tele. (2001)

21. Wagner, D., Willhalm, T.: Speed-Up Techniques for Shortest-Path Computations. In: 24th International Symposium on Theoretical Aspects of Computer Science (STACS). (2007) 23-36

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.