A new perspective on vertex connectivity

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 546-561

  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

[No Author keywords available]

Indexed keywords

ALGORITHMS;

BROADCAST ALGORITHM; CONNECTED DOMINATING SET; CONNECTED DOMINATING SETS; EDGE-DISJOINT SPANNING TREES; FUNDAMENTAL CONCEPTS; K-VERTEX CONNECTED GRAPHS; OPTIMAL THROUGHPUTS; VERTEX CONNECTIVITY;

TREES (MATHEMATICS);

EID: 84902108755     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.41     Document Type: Conference Paper

References (39)

1. A. Agarwal and M. Charikar. On the advantage of network coding for improving network throughput. In Proc. IEEE Inf. Theory Workshop, pages 247-249, 2004.
2. R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung. Network information flow. IEEE Trans. Inf. Theory, 46(4):1204-1216, 2000.
3. N. Alon, M. Ghaffari, B. Haeupler, and M. Khabbazian. Broadcast throughput in radio networks: Routing vs. network coding. Manuscript, 2013.
4. N. Alon and J. Spencer. The Probabilistic Method. John Wiley & Sons, New York, 1992.
5. 2) time. In Proc. 28th ACM Symp. on Theory of Computing (STOC), pages 47-55, 1996.
6. R. Carr and S. Vempala. Randomized metaround- ing (extended abstract). In Proceedings of the thirty-second annual ACM symposium on Theory of computing, STOC, pages 58-62, New York, NY, USA, 2000. ACM.
7. B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In Communications, 1997 ICC '97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference on, volume 1, pages 376-380 vol.1, 1997.
8. B. Das, R. Sivakumar, and V. Bharghavan. Routing in ad hoc networks using a spine. In Computer Communications and Networks, 1997. Proceedings., Sixth International Conference on, pages 34-39, 1997.
9. A. Ene, N. Korula, and A. Vakilian. Improved approximation algorithms for connected domatic partitions and related problems, http://arxiv.org/abs/1305. 4308, 2013.
10. U. Feige, M. Halldorsson, G. Kortsarz, and A. Srinivasan. Approximating the domatic number. SIAM J. Computing, 32(1):172-195, 2002.
11. C. Fragouli and E. Soljanin. Network coding fundamentals. Foundations and Trends in Networking, 2(1), 2007.
12. D. Fulkerson. Blocking and anti-blocking pairs of polyhedra. Mathematical Programming, 1(1):168-194, 1971.
13. A.Goel and S. Khanna. On the network coding advantage for wireless multicast in euclidean space. In Proc. 7th Conf. on Inf. Processing in Sensor Netw. (IPSN), pages 64-69, 2008.
14. S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374- 387, Apr. 1998.
15. B. Haeupler. Analyzing network coding gossip made easy. In Proc. 43rd ACM Symp. on Theory of Computing (STOC), pages 293-302, 2011.
16. B. L. Hartnell and D. F. Rail. Connected domatic number in planar graphs. Czech. Math. Journal, 51:173-179, 2001.
17. S. T. Hedetniemi and R. Laskar. Connected domination in graphs. Technical Report 414, Clemson University, SC, USA, 1983.
18. S. T. Hedetniemi and R. Laskar. Topics on domination. Annals of Discrete Mathematics, 48, 1991.
19. 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 Algorithms (SODA), pages 411-421, 1990.
20. D. R. Karger. Global min-cuts in RNC, and other ramifications of a simple min-out algorithm. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 21-30, 1993.
21. D. R. Karger. Random sampling in cut, flow, and network design problems. In Proc. 26th ACM Symp. on Theory of Computing (STOC), pages 648-657, 1994.
22. D. R. Karger. Using randomized sparsification to approximate minimum cuts. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 424-432, 1994.
23. D. R. Karger. A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. In Proc. 27th ACM Symp. on Theory of Computing (STOC), pages 11-17, 1995.
24. D. R. Karger. Minimum cuts in near-linear time. In Proc. 28th ACM Symp. on Theory of Computing (STOC), pages 56-63, 1996.
25. D. R. Karger and M. S. Levine. Finding maximum flows in undirected graphs seems easier than bipartite matching. In Proc. 30th ACM Symp. on Theory of Computing (STOC), pages 69-78, 1998.
26. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft. Xors in the air: Practical wireless network coding. In Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM '06, pages 243-254, 2006.
27. F. Kuhn, N. Lynch, and C. Newport. The abstract mac layer. Distributed Computing, 24(3): 187-206, 2011.
28. F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 513-522, 2010.
29. S. Kundu. Bounds on the number of disjoint spanning trees. J. of Comb. Theory, Series B, 17(2):199 - 203, 1974.
30. M. Langberg and M. Medard. On the multiple unicast network coding conjecture. In Proc. 47th Allerton Conf. on Comm., Control, and Computing, pages 222- 227, 2009.
31. Z. Li, B. Li, and L. C. Lau. A constant bound on throughput improvement of multicast network coding in undirected networks. IEEE Trans. Inf. Theory, 55(3):1016-1026, 2009.
32. M. V. Lomonosov and V. P. Polesskii. Lower bound of network reliability. Problems of Information Transmission, 7:118-123, 1971.
33. L. Lovasz. A characterization of perfect graphs. Journal of Combinatorial Theory, Series B, 13(2):95 - 98, 1972.
34. R. Misra and C. Mandal. Rotation of CDS via connected domatic partition in ad hoc sensor net-works. IEEE Trans, on Mobile Computing, 8(4):488- 499, 2009.
35. T. Moscibroda and R. Wattenhofer. Maximizing the lifetime of dominating sets. In Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International, pages 8 pp.-, 2005.
36. C. S. J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. of the London Math. Society, 36:445-450, 1961.
37. P. Sanders, S. Egner, and L. Tolhuizen. Polynomial time algorithms for network information flow. In Proc. 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 286-294, 2003.
38. W. T. Tutte. On the problem of decomposing a graph into n connected factors. J. of the London Math. Society, 36:221-230, 1961.
39. B. Zelinka. Connected domatic number of a graph. Math. Slovaca, 36:387-392, 1986.