Optimal distributed all pairs shortest paths and applications

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2012, Pages 355-364

  Holzer, Stephan ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

all pairs shortest paths; approximation; center; congest; diameter; distributed computing; eccentricity; girth; lower bound; message passing; peripheral vertices; radius

Indexed keywords

ALL PAIRS SHORTEST PATHS; APPROXIMATION; CENTER; CONGEST; DIAMETER; ECCENTRICITY; GIRTH; LOWER BOUNDS; PERIPHERAL VERTICES; RADIUS;

DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MESSAGE PASSING; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 84864981583     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2332432.2332504     Document Type: Conference Paper

References (49)

1. J. Abram and I. Rhodes. A decentralized shortest path algorithm. In Proceedings of the 16th Allerton Conference on Communication, Control and Computing (Allerton), pages 271-277, 1978.
2. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing (SICOMP), 28(4):1167-1181, 1999.
3. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 569-575, 1991.
4. N. Alon, O. Margalit, Z. Galilt, and M. Naor. Witnesses for boolean matrix multiplication and for shortest paths. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), pages 417-426, 1992.
5. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17(3):209-223, 1997.
6. U. Black. IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols. Prentice Hall PTR, 2000.
7. G. Blelloch, V. Vassilevska, and R. Williams. A new combinatorial approach for sparse graph problems. In Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (ICALP), pages 108-120, 2008.
8. P. Carrington, J. Scott, and S. Wasserman. Models and methods in social network analysis. Cambridge University Press, 2005.
9. T. Chan. All-pairs shortest paths for unweighted undirected graphs in o (mn) time. In Proceedings of the 17th annual ACM-SIAM symposium on Discrete algorithm (SODA), pages 514-523. ACM, 2006.
10. T. M. Chan. More algorithms for all-pairs shortest paths in weighted graphs. In Proceedings of the 39th annual ACM symposium on Theory of computing, (STOC), pages 590-598, New York, NY, USA, 2007. ACM.
11. K. Chandy and J. Misra. Distributed computation on graphs: Shortest path algorithms. Communications of the ACM (CACM), 25(11):833-837, 1982.
12. C. Chen. A distributed algorithm for shortest paths. IEEE Transactions on Computers (TC), 100(9):898-899, 1982.
13. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of symbolic computation (JSC), 9(3):251-280, 1990.
14. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. Proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC), 2011.
15. W. Dobosiewicz. A more efficient algorithm for the min-plus multiplication. International journal of computer mathematics, 32(1-2):49-60, 1990.
16. D. Dolev, C. Lenzen, and S. Peled. "tri, tri again": Finding triangles and small subgraphs in a distributed setting. CoRR, http://arxiv.org/abs/1201.6652, 2012.
17. D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM Journal on Computing (SICOMP), 29:1740, 2000.
18. M. Elkin. Computing almost shortest paths. In Proceedings of the 20th annual ACM symposium on Principles of distributed computing (PODC), pages 53-62, 2001.
19. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. In Proceedings of the 23rd annual ACM symposium on Theory of computing (STOC), pages 123-133, 1991.
20. G. Flake, S. Lawrence, and C. Giles. Efficient identification of web communities. In Proceedings of the 6th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD), pages 150-160. ACM, 2000.
21. M. Fredman. New bounds on the complexity of the shortest path problem. SIAM Journal on Computing (SICOMP), 5:83, 1976.
22. S. Frischknecht, S. Holzer, and R. Wattenhofer. Networks Cannot Compute Their Diameter in Sublinear Time. In Proceedings of the 23rd annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1150-1162.
23. Y. Han. Improved algorithm for all pairs shortest paths. Information Processing Letters (IPL), 91(5):245-250, 2004.
24. S. Holzer and R. Wattenhofer. Optimal distributed all pairs shortest paths and applications. http://www.dcg.ethz.ch/ stholzer/PODC12-APSP-full.pdf (preliminary full version to be submitted to a journal).
25. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing (SICOMP), 7:413, 1978.
26. M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar. Efficient distributed approximation algorithms via probabilistic tree embeddings. In Proceedings of the 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 263-272, 2008.
27. S. Kutten and D. Peleg. Fast distributed construction of small k-dominating sets and applications. Journal of Algorithms, 28(1):40-66, 1998.
28. N. Lynch. Distributed algorithms. Morgan Kaufmann, 1996.
29. J. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the arpanet. IEEE Transactions on Communications (TC), 28(5):711-719, 1980.
30. P. Merlin and A. Segall. A failsafe distributed routing protocol. IEEE Transactions on Communications (TC), 27(9):1280-1287, 1979.
31. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, 1999.
32. D. Peleg. Distributed computing: a locality-sensitive approach. 2000.
33. D. Peleg, L. Roditty, and E. Tal. Distributed algorithms for network diameter and girth. In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP), to appear, 2012.
34. L. Roditty and R. Tov. Approximating the girth. In Proceedings of the 22nd annual ACM-SIAM symposium on Discrete algorithm (SODA), pages 1446-1454, 2011.
35. L. Roditty and V. Williams. Minimum weight cycles and triangles: Equivalences and algorithms. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 180-189, 2011.
36. L. Roditty and V. Williams. Subquadratic time approximation algorithms for the girth. In Proceedings of the 23rd annual ACM-SIAM symposium on Discrete algorithm (SODA), pages 833-845, 2012.
37. A. Sarma, M. Dinitz, and G. Pandurangan. Efficient computation of distance sketches in distributed networks. 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), to appear, 2012.
38. M. Schwartz and T. Stern. Routing techniques used in computer communication networks. IEEE Transactions on Communications (TC), 28(4):539-552, 1980.
39. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences (JCSS), 51(3):400-403, 1995.
40. A. Shoshan and U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 605-614, 1999.
41. W. Tajibnapis. A correctness proof of a topology information maintenance protocol for a distributed computer network. Communications of the ACM (CACM), 20(7):477-485, 1977.
42. T. Takaoka. A new upper bound on the complexity of the all pairs shortest path problem. Information Processing Letters (IPL), 43(4):195-199, 1992.
43. T. Takaoka. A faster algorithm for the all-pairs shortest path problem and its application. Proceedings of the 10th Annual International Computing and Combinatorics Conference (COCOON), pages 278-289, 2004.
44. M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM (JACM), 52(1):1-24, 2005.
45. S. Toueg. An all-pairs shortest-paths distributed algorithm. Tech. Rep. RC 8327, IBM TJ Watson Research Center, Yorktown Heights, NY 10598, USA, 1980.
46. V. Williams. Multiplying matrices faster than coppersmith-winograd. Proceedings of the 44th annual ACM Symposium on Theory of Computing (STOC), 2012.
47. S. Yardi, D. Romero, G. Schoenebeck, and D. Boyd. Detecting spam in a twitter network. First Monday, 15(1), 2009.
48. R. Yuster and U. Zwick. Finding even cycles even faster. SIAM Journal on Discrete Mathematics (SIDMA), 10:209, 1997.
49. U. Zwick. A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. Algorithms and Computation, pages 841-843, 2005.