research-article

Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time

Authors:

Gramoz Goranci,

Monika Henzinger,

Mikkel ThorupAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 14, Issue 2

Article No.: 17, Pages 1 - 21

https://doi.org/10.1145/3174803

Published: 12 March 2018 Publication History

Abstract

We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with O(log³ n log log² n) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup (2007). It also stays in sharp contrast to a polynomial conditional lower bound for the fully dynamic weighted minimum cut problem. Our algorithm is obtained by combining a sparsification technique of Kawarabayashi and Thorup (2015) or its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental algorithm of Henzinger (1997).

We also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(nlog n/ε²) space Monte Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n) log³ n)/ε ²) amortized update time and constant query time, where α (n) stands for the inverse of Ackermann function.

References

[1]

Amir Abboud and Virginia Vassilevska Williams. 2014. Popular conjectures imply strong lower bounds for dynamic problems. In Proceedings of the 55th Symposium on Foundations of Computer Science (FOCS’14). IEEE, Los Alamitos, CA, 434--443.

Digital Library

[2]

Kook Jin Ahn and Sudipto Guha. 2009. Graph sparsification in the semi-streaming model. In Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP’09). 328--338.

Digital Library

[3]

Kook Jin Ahn, Sudipto Guha, and Andrew McGregor. 2012. Graph sketches: Sparsification, spanners, and subgraphs. In Proceedings of the 32nd Symposium on Principles of Database Systems (PODS’12). ACM, New York, NY, 5--14.

Digital Library

[4]

András A. Benczúr and David R. Karger. 2015. Randomized approximation schemes for cuts and flows in capacitated graphs. SIAM Journal on Computing 44, 2, 290--319.

[5]

Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos E. Tsourakakis. 2015. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In Proceedings of the 47th Symposium on Theory of Computing (STOC’15). ACM, New York, NY, 173--182.

Digital Library

[6]

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd ed.). MIT Press, Cambridge, MA.

Digital Library

[7]

E. A. Dinitz, A. V. Karzanov, and M. V. Lomonosov. 1976. On the structure of a family of minimum weighted cuts in a graph. Studies in Discrete Optimization 1976, 290--306.

[8]

Yefim Dinitz and Jeffery Westbrook. 1998. Maintaining the classes of 4-edge-connectivity in a graph on-line. Algorithmica 20, 3, 242--276.

[9]

Tamás Fleiner and András Frank. 2009. A quick proof for the cactus representation of mincuts. Retrieved February 10, 2018, from http://web.cs.elte.hu/&sim;frank/cikkek/FrankR3.pdf.

[10]

Harold N. Gabow. 1991. Applications of a poset representation to edge connectivity and graph rigidity. In Proceedings of the 32nd Symposium on Foundations of Computer Science (FOCS’91). IEEE, Los Alamitos, CA, 812--821.

Digital Library

[11]

Harold N. Gabow. 1995. A matroid approach to finding edge connectivity and packing arborescences. Journal of Computer and System Sciences 50, 2, 259--273.

Digital Library

[12]

Zvi Galil and Giuseppe F. Italiano. 1993. Maintaining the 3-edge-connected components of a graph on-line. SIAM Journal on Computing 22, 1, 11--28.

Digital Library

[13]

David Gibb, Bruce M. Kapron, Valerie King, and Nolan Thorn. 2015. Dynamic graph connectivity with improved worst case update time and sublinear space. arXiv:1509.06464.

[14]

Gramoz Goranci, Monika Henzinger, and Mikkel Thorup. 2016. Incremental exact min-cut in poly-logarithmic amortized update time. In Proceedings of the 24th European Symposium on Algorithms (ESA’16). 46:1--46:17.

[15]

Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the 47th Symposium on Theory of Computing (STOC’15). ACM, New York, NY, 21--30.

Digital Library

[16]

Monika Henzinger, Satish Rao, and Di Wang. 2017. Local flow partitioning for faster edge connectivity. In Proceedings of the 28th Symposium on Discrete Algorithms (SODA’17). 1919--1938.

Digital Library

[17]

Monika Rauch Henzinger. 1997. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. Journal of Algorithms 24, 1, 194--220.

Digital Library

[18]

David Karger. 1994. Random Sampling in Graph Optimization Problems. Ph.D. Dissertation. Stanford University, Stanford, CA.

Digital Library

[19]

David R. Karger. 1994. Using randomized sparsification to approximate minimum cuts. In Proceedings of the 5th Symposium on Discrete Algorithms (SODA’94). 424--432.

Digital Library

[20]

David R. Karger. 1999. Random sampling in cut, flow, and network design problems. Mathematics of Operations Research 24, 2, 383--413.

[21]

David R. Karger. 2000. Minimum cuts in near-linear time. Journal of the ACM 47, 1, 46--76.

Digital Library

[22]

Ken-Ichi Kawarabayashi and Mikkel Thorup. 2015. Deterministic global minimum cut of a simple graph in near-linear time. In Proceedings of the 47th Symposium on Theory of Computing (STOC’15). ACM, New York, NY, 665--674.

Digital Library

[23]

Jonathan A. Kelner and Alex Levin. 2013. Spectral sparsification in the semi-streaming setting. Theory of Computing Systems 53, 2, 243--262.

[24]

Rasmus Kyng, Jakub Pachocki, Richard Peng, and Sushant Sachdeva. 2017. A framework for analyzing resparsification algorithms. In Proceedings of the 28th Symposium on Discrete Algorithms (SODA’17). 2032--2043.

Digital Library

[25]

Jakub Lacki and Piotr Sankowski. 2011. Min-cuts and shortest cycles in planar graphs in O(n log log n) time. In Proceedings of the 19th European Symposium on Algorithms (ESA’11). 155--166.

[26]

Karl Menger. 1927. Zur allgemeinen kurventheorie. Fundamenta Mathematicae 1, 10, 96--115.

[27]

Hiroshi Nagamochi and Toshihide Ibaraki. 1992. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 5--6, 583--596.

[28]

Hiroshi Nagamochi and Toshihide Ibaraki. 2008. Algorithmic Aspects of Graph Connectivity. Cambridge University Press, New York, NY.

Digital Library

[29]

Danupon Nanongkai and Thatchaphol Saranurak. 2016. Dynamic cut oracle. Under submission.

[30]

Johannes A. La Poutré. 2000. Maintenance of 2- and 3-edge-connected components of graphs II. SIAM Journal on Computing 29, 5, 1521--1549.

Digital Library

[31]

Daniel Dominic Sleator and Robert Endre Tarjan. 1983. A data structure for dynamic trees. Journal of Computer and System Sciences 26, 3, 362--391.

Digital Library

[32]

Mikkel Thorup. 2007. Fully-dynamic min-cut. Combinatorica 27, 1, 91--127.

Digital Library

[33]

Mikkel Thorup and David R. Karger. 2000. Dynamic graph algorithms with applications. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory. 1--9.

Digital Library

Cited By

Kyng RMeierhans SProbst Gutenberg MMohar BShinkar IO'Donnell R(2024)A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their ApplicationsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649767(1174-1183)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649767
de Berg MLópez Martínez ASpieksma F(2024)Stable and Dynamic Minimum CutsWALCOM: Algorithms and Computation10.1007/978-981-97-0566-5_20(273-287)Online publication date: 18-Mar-2024
https://dl.acm.org/doi/10.1007/978-981-97-0566-5_20
Baswana SBhanja KPandey A(2023)Minimum+1 (s, t)-cuts and Dual-edge Sensitivity OracleACM Transactions on Algorithms10.1145/362327119:4(1-41)Online publication date: 7-Sep-2023
https://dl.acm.org/doi/10.1145/3623271
Show More Cited By

Index Terms

Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
1. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Dynamic graph algorithms
    2. Streaming, sublinear and near linear time algorithms

Recommendations

Deterministic Edge Connectivity in Near-Linear Time

We present a deterministic algorithm that computes the edge-connectivity of a graph in near-linear time. This is for a simple undirected unweighted graph G with n vertices and m edges. This is the first o(mn) time deterministic algorithm for the ...
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing

We present a deterministic near-linear time algorithm that computes the edge-connectivity and finds a minimum cut for a simple undirected unweighted graph G with n vertices and m edges. This is the first o(mn) time deterministic algorithm for the ...
Deterministic distributed vertex coloring in polylogarithmic time
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Consider an n-vertex graph G = (V,E) of maximum degree Δ, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neighbors in G. The communication is synchronous, i.e., it proceeds in discrete ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 14, Issue 2

April 2018

339 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/3196491

Editor:
Aravind Srinivasan
University of Maryland, USA

Issue’s Table of Contents

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 March 2018

Accepted: 01 December 2017

Revised: 01 September 2017

Received: 01 November 2016

Published in TALG Volume 14, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Danish Council for Independent Research under the Sapere Aude research career programme
European Research Council under the European Union’s 7th Framework Programme
ERC

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
317
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kyng RMeierhans SProbst Gutenberg MMohar BShinkar IO'Donnell R(2024)A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their ApplicationsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649767(1174-1183)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649767
de Berg MLópez Martínez ASpieksma F(2024)Stable and Dynamic Minimum CutsWALCOM: Algorithms and Computation10.1007/978-981-97-0566-5_20(273-287)Online publication date: 18-Mar-2024
https://dl.acm.org/doi/10.1007/978-981-97-0566-5_20
Baswana SBhanja KPandey A(2023)Minimum+1 (s, t)-cuts and Dual-edge Sensitivity OracleACM Transactions on Algorithms10.1145/362327119:4(1-41)Online publication date: 7-Sep-2023
https://dl.acm.org/doi/10.1145/3623271
Malik VKarmakar S(2023)Some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General GraphsAlgorithms and Discrete Applied Mathematics10.1007/978-3-031-25211-2_18(231-244)Online publication date: 26-Jan-2023
https://doi.org/10.1007/978-3-031-25211-2_18
Hanauer KHenzinger MSchulz C(2022)Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference GuideACM Journal of Experimental Algorithmics10.1145/355580627(1-45)Online publication date: 12-Aug-2022
https://dl.acm.org/doi/10.1145/3555806
Baswana SGupta SKnollmann T(2022)Mincut Sensitivity Data Structures for the Insertion of an EdgeAlgorithmica10.1007/s00453-022-00978-084:9(2702-2734)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s00453-022-00978-0
Law JAkers KTasnina NSantina CDeutsch SKshirsagar MKlein-Seetharaman JCrovella MRajagopalan PKasif SMurali T(2021)Interpretable network propagation with application to expanding the repertoire of human proteins that interact with SARS-CoV-2GigaScience10.1093/gigascience/giab08210:12Online publication date: 29-Dec-2021
https://doi.org/10.1093/gigascience/giab082
Chen LGoranci GHenzinger MPeng RSaranurak T(2020)Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00109(1135-1146)Online publication date: Nov-2020
https://doi.org/10.1109/FOCS46700.2020.00109
Durfee DGao YGoranci GPeng RCharikar MCohen E(2019)Fully dynamic spectral vertex sparsifiers and applicationsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing10.1145/3313276.3316379(914-925)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3313276.3316379

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents