Distributed algorithms for network diameter and girth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 660-672

  Peleg, David ^a   Roditty, Liam ^b   Tal, Elad ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS;

DISTRIBUTED APPROXIMATION ALGORITHM; DISTRIBUTED MODELING; EXACT ALGORITHMS; LOWER BOUNDS; MULTIPLICATIVE APPROXIMATIONS; NETWORK DIAMETER;

APPROXIMATION ALGORITHMS;

EID: 84884186295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_58     Document Type: Conference Paper

References (29)

1. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28(4), 1167-1181 (1999)
2. Almeida, P.S., Baquero, C., Cunha, A.: Fast distributed computation of distances in networks. Technical report (2011)
3. Antonio, J.K., Huang, G.M., Tsai,W.K.: A fast distributed shortest path algorithm for a class of hierarchically clustered data networks. IEEE Trans. Computers 41, 710-724 (1992)
4. Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: FOCS, pp. 591-602. IEEE Computer Society (2006)
5. Cicerone, S., D'Angelo, G., Di Stefano, G., Frigioni, D., Petricola, A.: Partially dynamic algorithms for distributed shortest paths and their experimental evaluation. J. Computers 2, 16-26 (2007)
6. Cidon, I., Jaffe, J.M., Sidi, M.: Local distributed deadlock detection by cycle detection and clustering. IEEE Trans. Software Eng. 13(1), 3-14 (1987)
7. Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math., 269-271 (1959)
8. Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM J. Comput. 29(5), 1740-1759 (2000)
9. Elkin, M.: Computing almost shortest paths. ACM Transactions on Algorithms 1(2), 283-323 (2005)
10. Floyd, R.W.: Algorithm 97: shortest path. Comm. ACM 5, 345 (1962)
11. Frischknecht, S., Holzer, S.,Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: Proc. 23rd ACM-SIAM Symp. on Discrete Algorithms, SODA (2012)
12. Haldar, S.: An 'all pairs shortest paths' distributed algorithm using 2n2 messages. J. Algorithms, 20-36 (1997)
13. Holzer, S., Wattenhofer, R.: Optimal distributed all pairs shortest paths and applications. In: Proc. 31st Annual ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, PODC (2012)
14. Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Computing 7(4), 413-423 (1978)
15. Kanchi, S., Vineyard, D.: Time optimal distributed all pairs shortest path problem. Int. J. of Information Theories and Applications, 141-146 (2004)
16. Kavitha, T., Liebchen, C., Mehlhorn, K., Michail, D., Rizzi, R., Ueckerdt, T., Zweig, K.A.: Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review 3(4), 199-243 (2009)
17. Krivelevich, M., Nutov, Z., Yuster, R.: Approximation algorithms for cycle packing problems. In: Proc. SODA, pp. 556-561 (2005)
18. Lingas, A., Lundell, E.-M.: Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett. 109(10), 493-498 (2009)
19. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)
20. Roditty, L., Tov, R.: Approximating the girth. In: Proc. SODA, pp. 1446-1454 (2011)
21. Roditty, L., Vassilevska Williams, V.: Minimum weight cycles and triangles: Equivalences and algorithms. In: Proc. FOCS, pp. 180-189 (2011)
22. Roditty, L., VassilevskaWilliams, V.: Subquadratic time approximation algorithms for the girth. In: SODA, pp. 833-845 (2012)
23. Segall, A.: Distributed network protocols. IEEE Trans. Inf. Th. IT-29, 23-35 (1983)
24. Seidel, R.: On the all-pairs-shortest-path problem in unweighted undirected graphs. JCSS 51, 400-403 (1995)
25. Warshall, S.: A theorem on boolean matrices. J. ACM 9(1), 11-12 (1962)
26. Vassilevska Williams, V.: Private communication
27. Vassilevska Williams, V.: Breaking the coppersmith-winograd barrier. In: STOC (2012)
28. Yuster, R.: Computing the diameter polynomially faster than apsp. CoRR, abs/1011.6181 (2010)
29. Zwick, U.: All pairs shortest paths using bridging sets and rectangular matrix multiplication. JACM 49(3), 289-317 (2002)