A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Finding the KT partition of a weighted graph in near-linear time
[article]
2021
arXiv
pre-print
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). A key component is finding the (1+ε)-KT partition of G, the coarsest partition {P_1, ..., P_k} of V such that for every non-trivial (1+ε)-near minimum cut with sides {S, S̅} it holds that P_i is contained in either S or S̅, for i=1, ..., k. Here we give a near-linear time randomized algorithm to find the (1+ε)-KT partition of a weighted graph.
arXiv:2111.01378v1
fatcat:w3basxih7vactpikdrcwtuqdy4