Local Flow Partitioning for Faster Edge Connectivity

SODA, pp. 1919-1938, 2017.

Cited by: 0|Bibtex|Views13
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com|arxiv.org

Abstract:

We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic O(m log2 n log log2 n) time algorithm. This improves both on the best previously known deterministic running time of O(m log12 n) (Kawarabayashi and Thorup [12]) and the best previously known randomized running time of O(m log3 n) (Karge...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments