Augmenting Undirected Edge Connectivity in Õ(n2) Time

@inproceedings{Benczr1998AugmentingUE,
  title={Augmenting Undirected Edge Connectivity in {\~O}(n2) Time},
  author={Andr{\'a}s A. Bencz{\'u}r and David R. Karger},
  booktitle={SODA},
  year={1998}
}
We give improved randomized (Monte Carlo) algorithms for un directed edge splitting and edge connectivity augmentation problems. Our algorithms run in time ~ O(n2) on n-vertex graphs, making them an ~ (m=n) factor faster than the best known deterministic ones on m-edge graphs. 

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…