Skip to main content
Log in

Parallel and fast sequential algorithms for undirected edge connectivity augmentation

  • Published:
Mathematical Programming Submit manuscript

1

,E2,..., such that ⋃i≤τEi optmially increases the connectivity by τ, for any integer τ. The main result of the paper is that this sequence of edge sets can be divided into O(n) groups such that within one group, all Ei are basically the same. Using this result, we improve on the running time of edge connectivity augmentation, as well as we give the first parallel (RNC) augmentation algorithm. We also present new efficient subroutines for finding the so-called extreme sets and the cactus representation of min-cuts required in our algorithms. Augmenting the connectivity of hypergraphs with ordinary edges is known to be structurally harder than that of ordinary graphs. In a weaker version when one exceptional hyperedge is allowed in the augmenting edge set, we derive similar results as for ordinary graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 1995 / Revised version received July 1998 Published online March 16, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benczúr, A. Parallel and fast sequential algorithms for undirected edge connectivity augmentation. Math. Program. 84, 595–640 (1999). https://doi.org/10.1007/s101070050042

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050042

Navigation