Drawing power law graphs using a local/global decomposition

Algorithmica (New York)

Volumn 47, Issue 4, 2007, Pages 379-397

  Andersen, Reid ^a   Chung, Fan ^a   Lu, Linyuan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Graph drawing; Hybrid graphs; Network flow; Power law graphs; Small world phenomenon

Indexed keywords

DEGREE DISTRIBUTIONS; HYBRID GRAPHS; NETWORK FLOW; POWER LAW GRAPHS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL METHODS; DRAWING (GRAPHICS); SET THEORY;

GRAPH THEORY;

EID: 33947607198     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0160-2     Document Type: Conference Paper

References (29)

1. L. A. Adamic and B. A. Huberman, Growth dynamics of the World Wide Web, Nature 401, September 9, 1999, p. 131.
2. W. Aiello, F. Chung and L. Lu, A random graph model for massive graphs, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000, pp. 171-180.
3. R. B. R. Azevedo and A. M. Leroi, A power law for cells, Proc. Natl. Acad. Sci. USA 98(10) (2001), 5699-5704.
4. A. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
5. A. Barabási, R. Albert and H. Jeong, Scale-free characteristics of random networks: the topology of the world wide web, Physica A 272 (1999), 173-187.
6. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tompkins and J. Wiener, Graph structure in the Web, Proceedings of the WWW) Conference, May, 2000, Amsterdam.
7. Paper version appeared in Computer Networks 33(1-6) (2000), 309-321.
8. K. Calvert, M. Doar and E. Zegura, Modeling Internet topology. IEEE Communications Magazine 35(6) (1997), 160-163.
9. C. Cooper and A. Frieze, On a general model of web graphs, Random Structures and Algorithms 22 (2003), 311-335.
10. M. Faloutsos, P. Faloutsos and C. Faloutsos, On power-law relationships of the Internet topology, Proceedings of the ACM SIGCOM Conference, Cambridge, MA, 1999.
11. S. Jain and S. Krishna, A model for the emergence of cooperation, interdependence, and structure in evolving networks, Proc. Natl. Acad. Sci. USA 98(2) (2001), 543-547.
12. J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins, The web as a graph: measurements, models and methods, Proceedings of the International Conference on Combinatorics and Computing, 1999.
13. S. R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins, Extracting large-scale knowledge bases from the web, Proceedings of the 25th VLDB Conference, Edinburgh, 1999.
14. M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA 98(2) (2001), 404-409.
15. F. Chung and L. Lu, Average distances in random graphs with given expected degree sequences, Proceedings of National Academy of Science, 99 (2002).
16. R. Andersen, F. Chung and L. Lu, Analyzing the small world phenomenon using a hybrid model with local network flow, Proceedings of the Third Workshop on Algorithms and Models for the Web-Graph, 2004.
17. N. Garg and J. Könemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Technical Report, Max-Planck-Institut fur Informatik, Saarbrucken, Germany (1997).
18. A. Itai, Y. Perl and Y. Shiloach, The complexity of finding maximum disjoint paths with length constraints, Networks 12 (1982).
19. S. Plotkin, D. B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, FOCS, 1991, pp. 495-504.
20. L. Lovász, V. Neumann-Lara and M. Plummer, Mengerian theorems for paths of bounded length, Periodica Mathematica Hungaria 9 (1978).
21. S. Boyles and G. Exoo, On line disjoint paths of bounded length, Discrete Mathematics 44 (1983).
22. G. Baier, Flows with Path Restrictions, Ph.D. thesis, Technische Universität Berlin, 2003.
23. P. Erdós and T. Gallai, Gráfok elóírt fokú pontokkal (Graphs with points of prescribed degrees, in Hungarian), Matematikai Lapok 11 (1961), 264-274.
24. S. C. North, Drawing graphs with NEATO, NEATO User Manual, April 26, 2004.
25. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs, Information Processing Letters 31(1) (1989), 7-15.
26. K. J. Lang, Fixing Two Weaknesses of the Spectral Method, Advances in Neural Information Processing Systems 18, MIT Press, Cambridge, MA, 2006.
27. B. Bollobás, The evolution of sparse random graphs, in Graph Theory and Combinatorics, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdós, Academic Press, New York, 1984, pp. 35-57.
28. M. Baur, U. Brandes, M. Gaertler and D. Wagner, Drawing the AS graph in 2.5 dimensions, Presented at the 12th International Symposium on Graph Drawing, 2004.
29. J. Grossman, P. Ion and R. De Castro, Facts about Erdós numbers and the collaboration graph, http://www.oakland.edu/~grossman/trivia.html.