About this Computer Science article
Augmenting Undirected Edge Connectivity in Õ(n2) Time by András A Benczúr; David R Karger is a Computer Science article available to read on EtoBox.
We give improved randomized Monte Carlo algorithms for undirected edge splitting and edge connectivity augmentation problems. Our algorithms run in time ̃2 Ž . Ž . O n on n-vertex graphs, making them an ⍀ mrn factor faster than the best known deterministic ones on m-edge graphs.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- András A Benczúr; David R Karger
- Publisher
- Elsevier Science; Elsevier ; Academic Press; Elsevier BV (ISSN 0196-6774)
- Published
- 2000
- Language
- EN
- Field
- Computer Science (Physical Sciences)