Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex

Gao Yu
Gao Yu
Li Jason
Li Jason
Nanongkai Danupon
Nanongkai Danupon
Saranurak Thatchaphol
Saranurak Thatchaphol
Yingchareonthawornchai Sorrachai
Yingchareonthawornchai Sorrachai
Cited by: 0|Bibtex|Views5|Links

Abstract:

We study deterministic algorithms for computing graph cuts, with focus on two fundamental problems: balanced sparse cut and $k$-vertex connectivity for small $k$ ($k=O(\polylog n)$). Both problems can be solved in near-linear time with randomized algorithms, but their previous deterministic counterparts take at least quadratic time. In ...More

Code:

Data:

Your rating :
0

 

Tags
Comments