Document Open Access Logo

Splitting-Off in Hypergraphs

Authors Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király , Shubhang Kulkarni

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2024.23.pdf
  • Filesize: 0.84 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Network optimization
  • Theory of computation → Routing and network design problems
Keywords
  • Hypergraphs
  • Hypergraph Connectivity
  • Splitting-off
  • Constructive Characterizations
  • Hypergraph Orientations
  • Submodular Functions
  • Combinatorial Optimization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The splitting-off operation in undirected graphs is a fundamental reduction operation that detaches all edges incident to a given vertex and adds new edges between the neighbors of that vertex while preserving their degrees. Lovász [Lov{á}sz, 1974; Lov{á}sz, 1993] and Mader [Mader, 1978] showed the existence of this operation while preserving global and local connectivities respectively in graphs under certain conditions. These results have far-reaching applications in graph algorithms literature [Lovász, 1976; Mader, 1978; Frank, 1993; Frank and Király, 2002; Király and Lau, 2008; Frank, 1992; Goemans and Bertsimas, 1993; Frank, 1994; Bang-Jensen et al., 1995; Frank, 2011; Nagamochi and Ibaraki, 2008; Nagamochi et al., 1997; Henzinger and Williamson, 1996; Goemans, 2001; Jordán, 2003; Kriesell, 2003; Jain et al., 2003; Chan et al., 2011; Bhalgat et al., 2008; Lau, 2007; Chekuri and Shepherd, 2008; Nägele and Zenklusen, 2020; Blauth and Nägele, 2023]. In this work, we introduce a splitting-off operation in hypergraphs. We show that there exists a local connectivity preserving complete splitting-off in hypergraphs and give a strongly polynomial-time algorithm to compute it in weighted hypergraphs. We illustrate the usefulness of our splitting-off operation in hypergraphs by showing two applications: (1) we give a constructive characterization of k-hyperedge-connected hypergraphs and (2) we give an alternate proof of an approximate min-max relation for max Steiner rooted-connected orientation of graphs and hypergraphs (due to Király and Lau [Király and Lau, 2008]). Our proof of the approximate min-max relation for graphs circumvents the Nash-Williams' strong orientation theorem and uses tools developed for hypergraphs.

Cite As Get BibTex

Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, and Shubhang Kulkarni. Splitting-Off in Hypergraphs. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 23:1-23:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ICALP.2024.23

Author Details

Kristóf Bérczi
  • MTA-ELTE Matroid Optimization Research Group and HUN-REN-ELTE Egerváry Research Group, Department of Operations Research, Eötvös Loránd University, Budapest, Hungary
Karthekeyan Chandrasekaran
  • University of Illinois, Urbana-Champaign, IL, USA
Tamás Király
  • MTA-ELTE Matroid Optimization Research Group and HUN-REN-ELTE Egerváry Research Group, Department of Operations Research, Eötvös Loránd University, Budapest, Hungary
Shubhang Kulkarni
  • University of Illinois, Urbana-Champaign, IL, USA

Funding

Karthekeyan and Shubhang were supported in part by NSF grants CCF-1814613 and CCF-1907937. Karthekeyan was supported in part by the Distinguished Guest Scientist Fellowship of the Hungarian Academy of Sciences - grant number VK-6/1/2022. Kristóf and Tamás were supported in part by the Lendület Programme of the Hungarian Academy of Sciences - grant number LP2021-1/2021, by the Ministry of Innovation and Technology of Hungary from the National Research, Development and Innovation Fund - grant number ELTE TKP 2021-NKTA-62 funding scheme, and by the Dynasnet European Research Council Synergy project - grant number ERC-2018-SYG 810115.

Acknowledgements

Part of this work was done while Karthekeyan and Shubhang were visiting Eötvös Loránd University. Karthekeyan thanks Eklavya Sharma for engaging in preliminary discussions on hypergraph splitting-off.

References

  1. O. Alrabiah, V. Guruswami, and R. Li. Randomly punctured reed–solomon codes achieve list-decoding capacity over linear-sized fields. In (To appear) Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC, 2024. Google Scholar
  2. J. Bang-Jensen, A. Frank, and B. Jackson. Preserving and increasing local edge-connectivity in mixed graphs. SIAM Journal on Discrete Mathematics, 8(2):155-178, 1995. Google Scholar
  3. J. Bang-Jenson and B. Jackson. Augmenting hypergraphs by edges of size two. Mathematical Programming, 84:467-481, 1999. Google Scholar
  4. N. Bansal, O. Svensson, and L. Trevisan. New notions and constructions of sparsification for graphs and hypergraphs. In IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS, pages 910-928, 2019. Google Scholar
  5. A. Bernáth and T. Király. Covering skew-supermodular functions by hypergraphs of minimum total size. Operations Research Letters, 37(5):345-350, 2009. Google Scholar
  6. A. Bernáth and T. Király. A unifying approach to splitting-off. Combinatorica, 32:373-401, 2012. Google Scholar
  7. A. Bhalgat, R. Hariharan, T. Kavitha, and D. Panigrahi. Fast Edge Splitting and Edmonds' Arborescence Construction for Unweighted Graphs. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 455-464, 2008. Google Scholar
  8. Jannis Blauth and Martin Nägele. An improved approximation guarantee for prize-collecting tsp. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 1848-1861, New York, NY, USA, 2023. Association for Computing Machinery. Google Scholar
  9. R. Cen, W. He, J. Li, and D. Panigrahi. Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows. In Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 2449-2488, 2023. Google Scholar
  10. R. Cen, J. Li, and D. Panigrahi. Augmenting edge connectivity via isolating cuts. In Proceedings of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 3237-3252, 2022. Google Scholar
  11. R. Cen, J. Li, and D. Panigrahi. Edge connectivity augmentation in near-linear time. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC, pages 137-150, 2022. Google Scholar
  12. Y. H. Chan, W. S. Fung, L. C. Lau, and C. K. Yung. Degree Bounded Network Design with Metric Costs. SIAM Journal on Computing, 40(4):953-980, 2011. Prelim. version in FOCS 2008. Google Scholar
  13. K. Chandrasekaran and C. Chekuri. Hypergraph k-cut for fixed k in deterministic polynomial time. Mathematics of Operations Research, 47(4), 2022. Prelim. version in FOCS 2020. Google Scholar
  14. K. Chandrasekaran and C. Chekuri. Min-max partitioning of hypergraphs and symmetric submodular functions. Combinatorica, 43:455-477, 2023. Prelim. version in SODA 2021. Google Scholar
  15. K. Chandrasekaran, C. Xu, and X. Yu. Hypergraph k-Cut in randomized polynomial time. Mathematical Programming, 186:85-113, 2021. Prelim. version in SODA 2018. Google Scholar
  16. C. Chekuri and N. Korula. A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests. SIAM Journal on Discrete Mathematics, 28(2):577-597, 2014. Prelim. version in ICALP 2009. Google Scholar
  17. C. Chekuri and B. Shepherd. Approximate Integer Decompositions for Undirected Network Design Problems. SIAM J. Discrete Math., 23:163-177, 2008. Google Scholar
  18. C. Chekuri and C. Xu. Minimum cuts and sparsification in hypergraphs. SIAM Journal on Computing, 47(6):2118-2156, 2018. Prelim. version in SODA 2016. Google Scholar
  19. Y. Chen, S. Khanna, and A. Nagda. Near-linear size hypergraph cut sparsifiers. In IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS, pages 61-72, 2020. Google Scholar
  20. B. Cosh. Vertex splitting and connectivity augmentation in hypergraphs. PhD thesis, University of London, 2000. Google Scholar
  21. K. Fox, D. Panigrahi, and F. Zhang. Minimum cut and minimum k-cut in hypergraphs via branching contractions. ACM Trans. Algorithms, 19(2), 2023. Prelim. version in SODA 2019. Google Scholar
  22. A. Frank. Augmenting graphs to meet edge-connectivity requirements. SIAM Journal on Discrete Mathematics, 5(1):25-53, 1992. Prelim. version in FOCS 1990. Google Scholar
  23. A Frank. Connectivity augmentation problems in network design. Mathematical Programming: State of the Art 1994, pages 34-63, 1994. Google Scholar
  24. A. Frank. Connections in Combinatorial Optimization. Oxford University Press, Oxford, 2011. Google Scholar
  25. A. Frank and Z. Király. Graph orientations with edge-connection and parity constraints. Combinatorica, 22:47-70, 2002. Google Scholar
  26. András Frank. Applications of submodular functions. Surveys in Combinatorics, 1993 (Keele), pages 85-136, 1993. Google Scholar
  27. H. N. Gabow. Efficient splitting off algorithms for graphs. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC, pages 696-705, 1994. Google Scholar
  28. M. Ghaffari, D. Karger, and D. Panigrahi. Random Contractions and Sampling for Hypergraph and Hedge Connectivity. In Proceedings of the 28th annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1101-1114, 2017. Google Scholar
  29. M. X. Goemans. Approximate Edge Splitting. SIAM Journal on Discrete Mathematics, 14(1):138-141, 2001. Google Scholar
  30. M.X. Goemans and D.J. Bertsimas. Survivable networks, linear programming relaxations and the parsimonious property. Mathematical Programming, 60:145-166, 1993. Google Scholar
  31. Z. Guo, R. Li, C. Shangguan, I. Tamo, and M. Wootters. Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. In IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS, pages 708-719, 2022. Google Scholar
  32. M. Henzinger and D. Williamson. On the number of small cuts in a graph. Information Processing Letters, 59:41-44, 1996. Google Scholar
  33. K. Jain, M. Mahdian, and M. R. Salavatipour. Packing Steiner Trees. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 266-274, 2003. Google Scholar
  34. A. Jambulapati, Y. P. Liu, and A. Sidford. Chaining, group leverage score overestimates, and fast spectral hypergraph sparsification. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC, pages 196-206, 2023. Google Scholar
  35. T. Jordán. On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. Discrete Applied Mathematics, 131(2):421-432, 2003. Google Scholar
  36. M. Kapralov, R. Krauthgamer, J. Tardos, and Y. Yoshida. Towards tight bounds for spectral sparsification of hypergraphs. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC, pages 598-611, 2021. Google Scholar
  37. M. Kapralov, R. Krauthgamer, J. Tardos, and Y. Yoshida. Spectral Hypergraph Sparsifiers of Nearly Linear Size. In IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS, pages 1159-1170, 2022. Google Scholar
  38. T. Király and L. C. Lau. Approximate min–max theorems for Steiner rooted-orientations of graphs and hypergraphs. Journal of Combinatorial Theory, Series B, 98:1233-1252, November 2008. Prelim. version in FOCS 2006. Google Scholar
  39. D. Kogan and R. Krauthgamer. Sketching cuts in graphs and hypergraphs. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS, pages 367-376, 2015. Google Scholar
  40. M. Kriesell. Edge-disjoint trees containing some given vertices in a graph. J. Comb. Theory Ser. B, 88:53-63, 2003. Google Scholar
  41. L. C. Lau. An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. Combinatorica, 27:71-90, 2007. Prelim. version in FOCS 2004. Google Scholar
  42. L. C. Lau and C. K. Yung. Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. SIAM Journal on Computing, 42(3):1185-1200, 2013. Prelim. version in IPCO 2010. Google Scholar
  43. J. R. Lee. Spectral hypergraph sparsification via chaining. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC, pages 207-218, 2023. Google Scholar
  44. P. Li and O. Milenkovic. Inhomogeneous hypergraph clustering with applications. Advances in neural information processing systems, 30, 2017. Google Scholar
  45. L. Lovász. Lecture. Presented in a Conference on Graph Theory, Prague, 1974. Google Scholar
  46. L. Lovász. On some connectivity properties of Eulerian graphs. Acta Math. Hungarica, 28:129-138, 1976. Google Scholar
  47. L. Lovász. Combinatorial Problems and Exercises, Second Edition. American Mathematical Soc., 1993. First Edition: North-Holland, Amsterdam, 1979. Google Scholar
  48. W. Mader. A reduction method for edge-connectivity in graphs. In Annals of Discrete Mathematics, volume 3, pages 145-164. Elsevier, 1978. Google Scholar
  49. H. Nagamochi and T. Ibaraki. Algorithmic Aspects of Graph Connectivity. Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2008. Google Scholar
  50. H. Nagamochi, K. Nishimura, and T. Ibaraki. Computing all small cuts in an undirected network. SIAM Journal on Discrete Mathematics, 10(3):469-481, 1997. Google Scholar
  51. M. Nägele and R. Zenklusen. A new contraction technique with applications to congruency-constrained cuts. Mathematical Programming, 183(2):455-481, 2020. Prelim. version in IPCO 2019. Google Scholar
  52. C. St. J. A. Nash-Williams. On orientations, connectivity and odd vertex pairings in finite graphs. Canad. J. Math, 12:555-567, 1960. Google Scholar
  53. C. St. J. A. Nash-Williams. Edge disjoint spanning trees of finite graphs. J. London Math. Soc., 36:445-450, 1961. Google Scholar
  54. S. Ornes. How big data carried graph theory into new dimensions. Quanta Magazine, 2021. URL: https://www.quantamagazine.org/how-big-data-carried-graph-theory-into-new-dimensions-20210819/.
  55. K. Quanrud. Quotient sparsification for submodular functions. Manuscript available at kentquanrud.com, November 2022.
  56. H. E. Robbins. A Theorem on Graphs with an Application to a Problem of Traffic Control. Amer. Math. Monthly, 46:281-283, 1939. Google Scholar
  57. S. Schlag, T. Heuer, L. Gottesbüren, Y. Akhremtsev, C. Schulz, and P. Sanders. High-quality hypergraph partitioning. ACM Journal of Experimental Algorithmics, 27:1-39, 2023. Google Scholar
  58. T. Soma and Y. Yoshida. Spectral sparsification of hypergraphs. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 2570-2581, 2019. Google Scholar
  59. W. T. Tutte. On the problem of decomposing a graph into n connected factors. J. London Math. Soc., 36:221-230, 1961. Google Scholar
  60. N. Veldt, A. R. Benson, and J. Kleinberg. Hypergraph cuts with general splitting functions. SIAM Review, 64(3):650-685, 2022. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact