Document Open Access Logo

Minimum+1 Steiner Cut and Dual Edge Sensitivity Oracle: Bridging Gap between Global and (s,t)-cut

Author Koustav Bhanja

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.27.pdf
  • Filesize: 2.47 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Data structures design and analysis
  • Theory of computation → Dynamic graph algorithms
  • Theory of computation → Network flows
Keywords
  • cut
  • mincut
  • minimum+1
  • steiner
  • edge fault
  • sensitivity oracle
  • dual edges

Metrics

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

Abstract

Let G = (V,E) be an undirected multi-graph on n = |V| vertices and S ⊆ V be a Steiner set in G. Steiner cut is a fundamental concept; moreover, global cut (|S| = n), as well as (s,t)-cut (|S| = 2), is just a special case of Steiner cut. We study Steiner cuts of capacity minimum+1, and as an important application, we provide a dual edge Sensitivity Oracle for Steiner mincut - a compact data structure for efficiently reporting a Steiner mincut after failure/insertion of any pair of edges.
A compact data structure for cuts of capacity minimum+1 has been designed for both global cuts [Dinitz and Nutov, STOC 1995] and (s,t)-cuts [Baswana, Bhanja, and Pandey, ICALP 2022 & TALG 2023]. Moreover, both data structures are also used crucially to design a dual edge Sensitivity Oracle for their respective mincuts. Unfortunately, except for these two extreme scenarios of Steiner cuts, no generalization of these results is known. Therefore, to address this gap, we present the following first results on Steiner cuts for any S satisfying 2 ≤ |S| ≤ n.  
1) Data Structure for Minimum+1 Steiner Cut: There is an {O}(n(n-|S|+1)) space data structure that, given any pair of vertices u,v, can determine in {O}(1) time whether the Steiner cut of the least capacity separating u and v has capacity minimum+1. It can report such a cut, if it exists, in {O}(n) time, which is worst-case optimal.
2) Dual Edge Sensitivity Oracle: We design the following pair of data structures. (a) There is an {O}(n(n-|S|+1)) space data structure that, after the failure or insertion of any pair of edges in G, can report the capacity of Steiner mincut in {O}(1) time and a Steiner mincut in {O}(n) time, which is worst-case optimal. (b) If we are interested in reporting only the capacity of Steiner mincut, there is a more compact data structure that occupies {O}((n-|S|)²+n) space and can report the capacity of Steiner mincut in {O}(1) time after the failure or insertion of any pair of edges. 
3) Lower Bound for Sensitivity Oracle: For undirected multi-graphs, for any Steiner set S ⊆ V, any data structure that, after the failure or insertion of any pair of edges, can report the capacity of Steiner mincut must occupy Ω((n-|S|)²) bits of space in the worst case, irrespective of the query time.  To arrive at our results, we provide several techniques, especially a generalization of the 3-Star Lemma given by Dinitz and Vainshtein [SICOMP 2000], which is of independent interest. 
Our results achieve the same space and time bounds of the existing results for the two extreme scenarios of Steiner cuts - global and (s,t)-cut. In addition, the space occupied by our data structures in (1) and (2) reduces as |S| tends to n. Also, they occupy subquadratic space if |S| is close to n.

Cite As Get BibTex

Koustav Bhanja. Minimum+1 Steiner Cut and Dual Edge Sensitivity Oracle: Bridging Gap between Global and (s,t)-cut. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 27:1-27:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.27

Author Details

Koustav Bhanja
  • Weizmann Institute of Science, Rehovot, Israel

Funding

This project is partially funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant agreement No. 949083

Acknowledgements

This research work was carried out during my doctoral studies at IIT Kanpur, India. I am grateful to my doctoral advisor, Prof. Surender Baswana, for reviewing this article, having many helpful discussions on connectivity carcass, and providing feedback on improving its readability. I am also thankful to an anonymous reviewer for carefully reviewing a preliminary version of this article and for highlighting subtle technical points that helped improve its quality.

References

  1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows - theory, algorithms and applications. Prentice Hall, 1993. Google Scholar
  2. Surender Baswana, Koustav Bhanja, and Abhyuday Pandey. Minimum+1 (s, t)-cuts and dual-edge sensitivity oracle. ACM Trans. Algorithms, 19(4):38:1-38:41, 2023. URL: https://doi.org/10.1145/3623271.
  3. Surender Baswana, Keerti Choudhary, Moazzam Hussain, and Liam Roditty. Approximate single-source fault tolerant shortest path. ACM Trans. Algorithms, 16(4):44:1-44:22, 2020. URL: https://doi.org/10.1145/3397532.
  4. Surender Baswana and Abhyuday Pandey. Sensitivity oracles for all-pairs mincuts. In Joseph (Seffi) Naor and Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pages 581-609. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.27.
  5. András A Benczúr. A representation of cuts within 6/5 times the edge connectivity with applications. In Proceedings of IEEE 36th Annual Foundations of Computer Science, pages 92-102. IEEE, 1995. URL: https://doi.org/10.1109/SFCS.1995.492466.
  6. Koustav Bhanja. Minimum+1 steiner cuts and dual edge sensitivity oracle: Bridging the gap between global cut and (s,t)-cut. CoRR, abs/2406.15129, 2024. URL: https://doi.org/10.48550/arXiv.2406.15129.
  7. Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, and Martin Schirneck. Approximate distance sensitivity oracles in subquadratic space. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 1396-1409, 2023. URL: https://doi.org/10.1145/3564246.3585251.
  8. John A Bondy and Miklós Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16(2):97-105, 1974. Google Scholar
  9. Diptarka Chakraborty, Kushagra Chatterjee, and Keerti Choudhary. Pairwise reachability oracles and preservers under failures. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), pages 35-1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  10. Chung-Kuan Cheng and T. C. Hu. Ancestor tree for arbitrary multi-terminal cut functions. Ann. Oper. Res., 33(3):199-213, 1991. URL: https://doi.org/10.1007/BF02115755.
  11. Keerti Choudhary. An optimal dual fault tolerant reachability oracle. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), pages 130-1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Google Scholar
  12. Efim A Dinitz, Alexander V Karzanov, and Michael V Lomonosov. On the structure of the system of minimum edge cuts in a graph. Issledovaniya po Diskretnoi Optimizatsii, pages 290-306, 1976. Google Scholar
  13. Yefim Dinitz. Maintaining the 4-edge-connected components of a graph on-line. In Second Israel Symposium on Theory of Computing Systems, ISTCS 1993, Natanya, Israel, June 7-9, 1993, Proceedings, pages 88-97. IEEE Computer Society, 1993. URL: https://doi.org/10.1109/ISTCS.1993.253480.
  14. Yefim Dinitz and Zeev Nutov. A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. In Frank Thomson Leighton and Allan Borodin, editors, Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA, pages 509-518. ACM, 1995. URL: https://doi.org/10.1145/225058.225268.
  15. Yefim Dinitz and Alek Vainshtein. The connectivity carcass of a vertex subset in a graph and its incremental maintenance. In Frank Thomson Leighton and Michael T. Goodrich, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pages 716-725. ACM, 1994. URL: https://doi.org/10.1145/195058.195442.
  16. Yefim Dinitz and Alek Vainshtein. Locally orientable graphs, cell structures, and a new algorithm for the incremental maintenance of connectivity carcasses. In Kenneth L. Clarkson, editor, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1995. San Francisco, California, USA, pages 302-311. ACM/SIAM, 1995. URL: http://dl.acm.org/citation.cfm?id=313651.313711.
  17. Yefim Dinitz and Alek Vainshtein. The general structure of edge-connectivity of a vertex subset in a graph and its incremental maintenance. odd case. SIAM J. Comput., 30(3):753-808, 2000. URL: https://doi.org/10.1137/S0097539797330045.
  18. Yefim Dinitz and Jeffery R. Westbrook. Maintaining the classes of 4-edge-connectivity in a graph on-line. Algorithmica, 20(3):242-276, 1998. URL: https://doi.org/10.1007/PL00009195.
  19. Ran Duan and Seth Pettie. Dual-failure distance and connectivity oracles. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pages 506-515. SIAM, 2009. URL: https://doi.org/10.1137/1.9781611973068.56.
  20. Paul Erdös. Extremal problems in graph theory. Publ. House Cszechoslovak Acad. Sci., Prague, pages 29-36, 1964. Google Scholar
  21. Zvi Galil and Giuseppe F. Italiano. Maintaining the 3-edge-connected components of a graph on-line. SIAM J. Comput., 22(1):11-28, 1993. URL: https://doi.org/10.1137/0222002.
  22. Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, and Ely Porat. Conditional lower bounds for space/time tradeoffs. In Algorithms and Data Structures: 15th International Symposium, WADS 2017, St. John’s, NL, Canada, July 31-August 2, 2017, Proceedings 15, pages 421-436. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-62127-2_36.
  23. Ralph E Gomory and Tien Chung Hu. Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4):551-570, 1961. Google Scholar
  24. Gramoz Goranci, Monika Henzinger, and Mikkel Thorup. Incremental exact min-cut in polylogarithmic amortized update time. ACM Trans. Algorithms, 14(2):17:1-17:21, 2018. URL: https://doi.org/10.1145/3174803.
  25. Manoj Gupta and Shahbaz Khan. Multiple source dual fault tolerant bfs trees. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), pages 127-1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  26. Giuseppe F. Italiano, Adam Karczmarz, and Nikos Parotsidis. Planar reachability under single vertex or edge failures. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 2739-2758. SIAM, 2021. URL: https://doi.org/10.1137/1.9781611976465.163.
  27. Ken-ichi Kawarabayashi and Mikkel Thorup. Deterministic edge connectivity in near-linear time. J. ACM, 66(1):4:1-4:50, 2019. URL: https://doi.org/10.1145/3274663.
  28. L. Lovász. Combinatorial problems and exercises. North-Holland Publishing Co., Amsterdam-New York, 1979. Google Scholar
  29. Merav Parter. Dual failure resilient BFS structure. In Chryssis Georgiou and Paul G. Spirakis, editors, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 21 - 23, 2015, pages 481-490. ACM, 2015. URL: https://doi.org/10.1145/2767386.2767408.
  30. Mihai Patrascu. Unifying the landscape of cell-probe lower bounds. SIAM J. Comput., 40(3):827-847, 2011. URL: https://doi.org/10.1137/09075336X.
  31. Jean-Claude Picard and Maurice Queyranne. On the structure of all minimum cuts in a network and applications. In Rayward-Smith V.J. (eds) Combinatorial Optimization II. Mathematical Programming Studies, 13(1):8-16, 1980. URL: https://doi.org/10.1007/BFb0120902.
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