A Simple Deterministic Algorithm for Edge Connectivity

We show a deterministic algorithm for computing edge connectivity of a simple graph with $m$ edges in $m^{1+o(1)}$ time. Although the fastest deterministic algorithm by Henzinger, Rao, and Wang [SODA'17] has a faster running time of $O(m\log^{2}m\log\log m)$, we believe that our algorithm is conceptually simpler. The key tool for this simplication is the expander decomposition. We exploit it in a very straightforward way compared to how it has been previously used in the literature.

[1]  Thatchaphol Saranurak,et al.  The Expander Hierarchy and its Applications to Dynamic Graph Algorithms , 2020, ACM-SIAM Symposium on Discrete Algorithms.

[2]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[3]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[4]  Yu Cheng,et al.  Sparsification of Balanced Directed Graphs , 2020 .

[5]  Xiaorui Sun,et al.  Fully Dynamic c-Edge Connectivity in Subpolynomial Time , 2020, ArXiv.

[6]  David P. Woodruff,et al.  On Sketching Quadratic Forms , 2015, ITCS.

[7]  Richard Peng,et al.  Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[8]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[9]  Julia Chuzhoy,et al.  A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems , 2019, STOC.

[10]  Yi-Jun Chang,et al.  Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[11]  Debmalya Panigrahi,et al.  Deterministic Min-cut in Poly-logarithmic Max-flows , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[12]  Shang-Hua Teng,et al.  A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning , 2008, SIAM J. Comput..

[13]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[14]  Aaron Sidford,et al.  Efficient Õ(n/∊) Spectral Sketches for the Laplacian and its Pseudoinverse , 2018, SODA.

[15]  Richard Peng,et al.  Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[16]  Will Rosenbaum,et al.  On Sampling Edges Almost Uniformly , 2017, SOSA.

[17]  Christian Wulff-Nilsen,et al.  Fully-dynamic minimum spanning forest with improved worst-case update time , 2016, STOC.

[18]  Richard Peng,et al.  A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[19]  Di Wang,et al.  Local Flow Partitioning for Faster Edge Connectivity , 2017, SODA.

[20]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[21]  Shang-Hua Teng,et al.  Spectral Sparsification of Graphs , 2008, SIAM J. Comput..

[22]  Christian Wulff-Nilsen,et al.  Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[23]  Oren Weimann,et al.  A Note on a Recent Algorithm for Minimum Cut , 2020, SOSA.

[24]  Thatchaphol Saranurak,et al.  Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition , 2020, SODA.

[25]  Richard Peng,et al.  Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs , 2016, STOC.

[26]  Nisheeth K. Vishnoi,et al.  Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator , 2011, STOC '12.

[27]  Thatchaphol Saranurak,et al.  Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time , 2017, STOC.

[28]  Sanjeev Khanna,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[29]  Mikkel Thorup,et al.  Faster Algorithms for Edge Connectivity via Random 2-Out Contractions , 2019, SODA.

[30]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[31]  Maximilian Probst Gutenberg,et al.  Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , 2020, ICALP.

[32]  Keren Censor-Hillel,et al.  On Distributed Listing of Cliques , 2020, PODC.

[33]  Thatchaphol Saranurak,et al.  Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[34]  Santosh S. Vempala,et al.  On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[35]  Sanjeev Khanna,et al.  The all-or-nothing multicommodity flow problem , 2004, STOC '04.

[36]  Monika Henzinger,et al.  Distributed edge connectivity in sublinear time , 2019, STOC.

[37]  Di Wang,et al.  Expander Decomposition and Pruning: Faster, Stronger, and Simpler , 2018, SODA.

[38]  Seth Pettie,et al.  Distributed Triangle Detection via Expander Decomposition , 2018, SODA.

[39]  Nisheeth K. Vishnoi,et al.  Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition , 2010, SODA '11.

[40]  David R. Karger,et al.  A new approach to the minimum cut problem , 1996, JACM.

[41]  James B. Orlin,et al.  A Faster Algorithm for Finding the Minimum Cut in a Directed Graph , 1994, J. Algorithms.

[42]  Richard Peng,et al.  Vertex Sparsification for Edge Connectivity , 2020, SODA.

[43]  Ken-ichi Kawarabayashi,et al.  Deterministic Edge Connectivity in Near-Linear Time , 2014, J. ACM.

[44]  Yin Tat Lee,et al.  An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.

[45]  Luca Trevisan,et al.  Approximation algorithms for unique games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[46]  Harold N. Gabow.  A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.

[47]  S. Mozes,et al.  Minimum Cut in O(m log2n) Time , 2019, ArXiv.

[48]  Danupon Nanongkai,et al.  Weighted min-cut: sequential, cut-query, and streaming algorithms , 2019, STOC.

[49]  Yi-Jun Chang,et al.  Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration , 2019, PODC.

[50]  Harold N. Gabow,et al.  Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs , 1995, IPCO.

[51]  David R. Karger,et al.  Minimum cuts in near-linear time , 1998, JACM.