Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs

ACM Journal of Experimental Algorithmics

Volumn 13, Issue , 2009, Pages 1.1-1.9

  Magnien, Clémence ^a   Latapy, Matthieu ^a   Habib, Michel ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Algorithms; Diameter bounds; graph diameter

Indexed keywords

EID: 85016195357     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/1412228.1455266     Document Type: Article

References (19)

1. Aingworth, Chekuri, and Motwani. 1996. Fast estimation of diameter and shortest paths (without matrix multiplication). In ACM-SIAM SODA.
2. Alon, N., Galil, Z., Margalit, O., and Naor, M. 1992. Witnesses for boolean matrix multiplication and for shortest paths. In IEEE FOCS.
3. Broder, A., Kumar, S., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., and Wiener, J. L. 2000. Graph structure in the web. Computer Networks 33.
4. Chan, T. M. 2006. All-pairs shortest paths for unweighted undirected graphs in o(mn) time. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. 514-523.
5. Chepoi, V. D. and Dragan, F. F. 1994. Linear-time algorithm for finding a central vertex of a chordal graph. In Proceedings of the second Annual European Symposium Algorithms, ESA’94, LNCS. Vol. 855.
6. Corneil, D., Dragan, F., Habib, M., and Paul, C. 2001. Diameter determination on restricted graph families. Discrete Applied Mathematics 113, 2-3.
7. Corneil, D., Dragan, F., and Köhler, E. 2003. On the power of bfs to determine a graph’s diameter. Networks 42 (4).
8. Dor, D., Halperin, S., and Zwick, U. 1997. All pairs almost shortest paths. ECCC 4, 040.
9. Dragan, F., Nicolai, F., and Brandstädt, A. 1997. Lexbfs-orderings and powers of graphs. In Proceedings of the 22nd international workshop. Graph-Theoretic Concepts in Computer Science, WG’96, LNCS. Vol. 1197.
10. Dragan, F. F. 2005. Estimating all pairs shortest paths in restricted graph families: a unified approach. J. Algorithms 57, 1, 1-21.
11. Faloutsos, M., Faloutsos, P., and Faloutsos, C. 1999. On power-law relationships of the internet topology. In ACM SIGCOMM.
12. Feder, T. and Motwani, R. 1991. Clique partitions, graph compression, and speeding-up algorithms. In ACMSTOC.
13. Handler, G. 1973. Minimax location of a facility in an undirected tree graph. Transportation Science 7 (3).
14. Latapy, M. and Magnien, C. 2008. Complex network measurements: Estimating the relevance of observed properties. To appear in the proceedings of ieee infocom.
15. Leskovec, J., Kleinberg, J., and Faloutsos, C. 2005. Graphs over time: Densification laws, shrinking diameters and possible explanations. In ACM SIGKDD.
16. Parnas, M. and Ron, D. 2002. Testing the diameter of graphs. Random Struct. Algorithms 20, 2, 165-183.
17. Seidel, R. 1992. On the all-pairs-shortest-path problem. In ACMSTOC.
18. Watts, D. and Strogatz, S. 1998. Collective dynamics of small-world networks. Nature 393.
19. Zwick, U. 2001. Exact and approximate distances in graphs—A survey. In ESA. Vol. 2161.