Papers
Topics
Authors
Recent
Search
2000 character limit reached

Finding the KT partition of a weighted graph in near-linear time

Published 2 Nov 2021 in cs.DS and quant-ph | (2111.01378v1)

Abstract: In a breakthrough work, Kawarabayashi and Thorup (J.~ACM'19) gave a near-linear time deterministic algorithm for minimum cut in a simple graph G=(V,E)G = (V,E). A key component is finding the (1+ε)(1+\varepsilon)-KT partition of GG, the coarsest partition {P1,…,Pk}\{P_1, \ldots, P_k\} of VV such that for every non-trivial (1+ε)(1+\varepsilon)-near minimum cut with sides {S,Sˉ}\{S, \bar{S}\} it holds that PiP_i is contained in either SS or Sˉ\bar{S}, for i=1,…,ki=1, \ldots, k. Here we give a near-linear time randomized algorithm to find the (1+ε)(1+\varepsilon)-KT partition of a weighted graph. Our algorithm is quite different from that of Kawarabayashi and Thorup and builds on Karger's framework of tree-respecting cuts (J.~ACM'00). We describe applications of the algorithm. (i) The algorithm makes progress towards a more efficient algorithm for constructing the polygon representation of the set of near-minimum cuts in a graph. This is a generalization of the cactus representation initially described by Bencz\'ur (FOCS'95). (ii) We improve the time complexity of a recent quantum algorithm for minimum cut in a simple graph in the adjacency list model from O~(n3/2)\widetilde O(n^{3/2}) to O~(mn)\widetilde O(\sqrt{mn}). (iii) We describe a new type of randomized algorithm for minimum cut in simple graphs with complexity O(m+nlog⁡6n)O(m + n \log^6 n). For slightly dense graphs this matches the complexity of the current best O(m+nlog⁡2n)O(m + n \log^2 n) algorithm which uses a different approach based on random contractions. The key technical contribution of our work is the following. Given a weighted graph GG with mm edges and a spanning tree TT, consider the graph HH whose nodes are the edges of TT, and where there is an edge between two nodes of HH iff the corresponding 2-respecting cut of TT is a non-trivial near-minimum cut of GG. We give a O(mlog⁡4n)O(m \log^4 n) time deterministic algorithm to compute a spanning forest of HH.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.