Local flow partitioning for faster edge connectivity

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 1919-1938, 2017.

Cited by: 0|Bibtex|Views2|
EI
Other Links: dl.acm.org|arxiv.org

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments