Document

# Mincut Sensitivity Data Structures for the Insertion of an Edge

## File

LIPIcs.ESA.2020.12.pdf
• Filesize: 0.51 MB
• 14 pages

## Acknowledgements

We would like to convey special thanks to Jannik Castenow from the Heinz Nixdorf Institute and the Paderborn University for many valuable discussions. Additionally, we would like to thank Rajesh Chitnis and Robert Krauthgamer for promptly answering a few of our queries related to their paper [Rajesh Chitnis et al., 2016].

## Cite As

Surender Baswana, Shiv Gupta, and Till Knollmann. Mincut Sensitivity Data Structures for the Insertion of an Edge. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ESA.2020.12

## Abstract

Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of vertices that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can efficiently report the set of all pairs from S× S whose mincut value increases upon insertion of the edge (x,y) to G. The only result that exists for this problem is for a single pair of vertices (Picard and Queyranne, Mathematical Programming Study, 13 (1980), 8-16). We present the following results for the single source and the all-pairs versions of this problem. 1) Single source: Given any designated source vertex s, there exists a data structure of size 𝒪(|S|) that can output all those vertices from S whose mincut value to s increases upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(|S|). 2) All-pairs: There exists an 𝒪(|S|²) size data structure that can output all those pairs of vertices from S× S whose mincut value gets increased upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(k), where k is the number of pairs of vertices whose mincut increases. For both these versions, we also address the problem of reporting the values of the mincuts upon insertion of any given edge. To derive our results, we use interesting insights into the nearest and the farthest mincuts for a pair of vertices. In addition, a crucial result, that we establish and use in our data structures, is that there exists a directed acyclic graph of 𝒪(n) size that compactly stores the farthest mincuts from all vertices of V to a designated vertex s in the graph. We believe that this result is of independent interest, especially, because it also complements a previously existing result by Hariharan et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar family, and hence, can be stored compactly in a tree of 𝒪(n) size.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Dynamic graph algorithms
• Mathematics of computing → Network flows
• Mathematics of computing → Graph algorithms
##### Keywords
• Mincut
• Sensitivity
• Data Structure

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Alfred V. Aho, M. R. Garey, and Jeffrey D. Ullman. The transitive reduction of a directed graph. SIAM J. Comput., 1(2):131-137, 1972. URL: https://doi.org/10.1137/0201008.
2. Surender Baswana, Shiv Gupta, and Till Knollmann. Mincut Sensitivity Data Structures for the Insertion of an Edge, 2020. URL: http://www.cse.iitk.ac.in/users/sbaswana/Papers-published/esa-2020-fv.pdf.
3. Michael A. Bender and Martin Farach-Colton. The level ancestor problem simplified. Theor. Comput. Sci., 321(1):5-12, 2004. URL: https://doi.org/10.1016/j.tcs.2003.05.002.
4. Rajesh Chitnis, Lior Kamma, and Robert Krauthgamer. Tight bounds for gomory-hu-like cut counting. In Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers, pages 133-144, 2016. URL: https://doi.org/10.1007/978-3-662-53536-3_12.
5. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399–404, 1956. URL: https://doi.org/10.4153/CJM-1956-045-5.
6. R. E. Gomory and T. C. Hu. Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4):551-570, 1961. URL: http://www.jstor.org/stable/2098881.
7. 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.
8. Dan Gusfield. Very simple methods for all pairs network flow analysis. SIAM J. Comput., 19(1):143-155, February 1990. URL: https://doi.org/10.1137/0219009.
9. Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, and Anand Bhalgat. An Õ(mn) gomory-hu tree construction algorithm for unweighted graphs. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pages 605-614, 2007. See also the extended version at http://hariharan-ramesh.com/papers/gohu.pdf. URL: https://doi.org/10.1145/1250790.1250879.
10. Tanja Hartmann and Dorothea Wagner. Fast and simple fully-dynamic cut tree construction. In Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, pages 95-105, 2012. URL: https://doi.org/10.1007/978-3-642-35261-4_13.
11. 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.
12. Mikkel Thorup. Fully-dynamic min-cut. Combinatorica, 27(1):91-127, 2007. URL: https://doi.org/10.1007/s00493-007-0045-2.
X

Feedback for Dagstuhl Publishing