Distributed connectivity decomposition

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2014, Pages 156-165

  Censor Hillel, Keren ^a   Ghaffari, Mohsen ^b   Kuhn, Fabian ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Decomposition; Distributed Algorithm; Graph connectivity

Indexed keywords

COMPLEX NETWORKS; DECOMPOSITION; PARALLEL ALGORITHMS; TREES (MATHEMATICS);

BROADCAST ROUTING; CENTRALIZED ALGORITHMS; DECOMPOSITION ALGORITHM; DISTRIBUTED NETWORKS; EDGE CONNECTIVITY; GRAPH CONNECTIVITY; INFORMATION FLOWS; VERTEX CONNECTIVITY;

APPROXIMATION ALGORITHMS;

EID: 84905482247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2611462.2611491     Document Type: Conference Paper

References (53)

1. Aho A.V.,Hopcroft J.E.,Ullman J.D. The Design & Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast network decomposition. In Proc. 11th ACM Symp. on Principles of Distributed Computing (PODC), pages 169-177, 1992.
3. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast distributed network decompositions and covers. Journal of Parallel and Distributed Computing, 39(2):105-114, 1996.
4. B. Awerbuch, M. Luby, A. Goldberg, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Proc. 30th IEEE Symp. Foundations of Computer Science (FOCS), pages 364-369, 1989.
5. Y. Azar , E.Cohen, A.Fiat, H.Kaplan, and H.Racke. Optimal oblivious routing in polynomial time. In Proc. 35th ACM Symp. on Theory of Computing (STOG), pages 383-388, 2003.
6. F. Barahona. Packing spanning trees. Mathematics of Operations Research, 20(1):104-115, 1995.
7. M. Bienkowski, M. Korzeniowski, and H. Räcke. A practical algorithm for constructing oblivious routing schemes. In Proc. 15th ACM Symp. on Parallel Algorithms and, Architectures (SPAA), pages 24-33, 2003.
8. J. Bondy and U. Murty. Graph theory (graduate texts in mathematics, vol. 244), 2008.
9. R. Carr and S. Vempala. Randomized metarounding (extended abstract). In Proc. 32nd, ACM Symp. on Theory of Computing (STOG), pages 58-62, 2000.
10. K. Censor-Hillel, M. Ghaffari, and F. Kuhn. Distributed connectivity decomposition. CoRR, abs/1311.5317, 2013.
11. K. Censor-Hillel, M. Ghaffari, and F. Kuhn. A new perspective on vertex connectivity. In Proc. 25th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2014.
12. J. Cheriyan and S. Maheshwari. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. Journal of Algorithms, 9(4):507-537, 1988.
13. 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. SIAM I. on Comp., 41(5):1235-1265, 2012.
14. A. Das Sarma, D. Nanongkai, and G. Pandurangan. Fast distributed random walks. In The Proceedings of the International Symposium on Principles of Distributed Computing (PODC), pages 161-170, 2009.
15. A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Efficient distributed random walks with applications. In The Proceedings of the International Symposium on Principles of Distributed Computing (PODC), pages 201-210, 2010.
16. A. Ene, N. Korula, and A. Vakilian. Connected domatic packings in node-capacitated graphs. http://arxiv.org/abs/1305.4308/v2, 2013.
17. S. Even. An algorithm for determining whether the connectivity of a graph is at least k. SIAM Journal on Computing, 4(3):393-396, 1975.
18. U. Feige, M. M. Halldórsson, and G. Kortsarz. Approximating the domatic number. In The Proceedings of the Symposium on Theory of Computing (STOG), pages 134-143, 2000.
19. S. Frischknecht, S. Holzer, and R. Wattenhofer. Networks cannot compute their diameter in sublinear time. In The Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1150-1162, 2012.
20. H. Gabow. Using expander graphs to find vertex connectivity. In Proc. 41st IEEE Symp. Foundations of Computer Science (FOGS), pages 410-420, 2000.
21. H. Gabow and H. Westermann. Forests, frames, and games: algorithms for matroid sums and applications. In Proc. 20th ACM Symp. on Theory of Computing (STOG), pages 407-421, 1988.
22. Z. Galii. Finding the vertex connectivity of graphs. SIAM Journal on Computing, 9(1):197-199, 1980.
23. M. Ghaffari and F. Kuhn. Distributed minimum cut approximation. In Proc. 27th Symp. on Distributed Computing (DISC), pages 1-15, 2013.
24. S. Guha and S. K huiler. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374-387, Apr. 1998.
25. B. Haeupler and F. Kuhn. Lower bounds on information dissemination in dynamic networks. In Distributed Computing, pages 166-180. Springer, 2012.
26. M. T. Hajiaghayi, R. D. Kleinberg, H. Räcke, and T. Leighton. Oblivious routing on node-capacitated and directed graphs. ACM Trans. Algorithms, 3(4), Nov. 2007.
27. C. Harrelson, K. Hildrum, and S. Rao. A polynomial-time tree decomposition to minimize congestion. In Proc. 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 34-43, 2003.
28. M. R. Henzinger. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. J. Algorithms, 24(1): 194-220, 1997.
29. M. R. Henzinger, S. Rao, and H. N. Gabow. Computing vertex connectivity: new bounds from old techniques. In Proc. 37th IEEE Symp. Foundations of Computer Science (FOGS), pages 462-471. IEEE,
30. S. Holzer and R. Wattenhofer. Optimal distributed all pairs shortest paths and applications. In The Proceedings of the International Symposium on Principles of Distributed Computing (PODC), pages 355-364, 2012.
31. A. Itai and M. Rodeh. The multi-tree approach to reliability in distributed networks. Information and, Computation, 79(1):43-59, 1988.
32. A. Kanevsky. On the number of minimum size separating vertex sets in a graph and how to find all of them. In Proc. 1st ACM-SIAM Symp. on Discrete Algorithm, (SODA), pages 411-421, 1990.
33. D. R. Karger. Using randomized sparsification to approximate minimum cuts. In Proc. 5th, ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 424-432, 1994.
34. D. R. Karger. Minimum cuts in near-linear time. In Proc. 28th ACM Symp. on Theory of Computing (STOC), STOC'96, pages 56-63, 1996.
35. S. Khuller and B. Schieber. On independent spanning trees. Information Processing Letters, 42(6):321-323, 1992.
36. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 23(3):466-487, 1994.
37. F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In The Proceedings of the Symposium on Theory of Computing (STOC), pages 513-522, 2010.
38. S. Kundu. Bounds on the number of disjoint spanning trees. J. of Comb. Theory, Series B, 17(2): 199 - 203, 1974.
39. S. Kutten and D. Peleg. Fast distributed construction of k-dominating sets and applications. In Proc. 14th A CM Symp. on Principles of Distributed Computing (PODC), pages 238-251, 1995.
40. C. Lenzen and B. Patt-Shamir. Fast routing table construction using small messages: Extended abstract. In The Proceedings of the Symposium on Theory of Computing (STOC), pages 381-390, 2013.
41. Z. Li, B. Li, and L. C. Lan. A constant bound on throughput improvement of multicast network coding in undirected networks. IEEE Trans. Inf. Theory, 55(3):1016-1026, 2009.
42. D. Nanogkai. Distributed approximation algorithms for weighted shortest paths. In The Proceedings of the Symposium on Theory of Computing (STOC), 2014, to appear.
43. D. Nanongkai, A. Das Sarma, and G. Pandurangan. A tight unconditional lower bound on distributed randomwalk computation. In The Proceedings of the International Symposium on Principles of Distributed Computing (PODC), pages 257-266, 2011.
44. C. Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. of the London Math. Society, 36:445-450, 1961.
45. A. Panconesi and A. Srinivasan. Improved distributed algorithms for coloring and network decomposition problems. In Proc. 24th ACM Symp. on Theory of Computing (STOC), STOC '92, pages 581-592, 1992.
46. D. Peleg. Distributed computing: a locality-sensitive approach, volume 5. SIAM, 2000.
47. S. A. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proc. 32nd, IEEE Symp. Foundations of Computer Science (FOCS), pages 495-504, 1991.
48. H. Räcke. Minimizing congestion in general networks. In Proc. 43rd IEEE Symp. Foundations of Computer-Science (FOGS), pages 43-52, 2002.
49. H. Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Proc. 35th ACM Symp. on Theory of Computing (STOC), pages 255-264, 2008.
50. F. Shahrokhi and D. W. Matula. The maximum concurrent flow problem. Journal of the ACM (JACM), 37(2):318-334, 1990.
51. R. E. Tarjan. Testing graph connectivity. In Proc. 6th, ACM Symp. on Theory of Computing (STOC), STOC '74, pages 185-193, 1974.
52. W. T. Tutte. On the problem of decomposing a graph into n connected factors. J. of the London Math. Society, 36:221-230, 1961.
53. A. Zehavi and A. Itai. Three tree-paths. Journal of Graph, Theory, 13(2): 175-188, 1989.