Computing edge-connectivity augmentation function in O(nm) time
Conference
·
OSTI ID:471722
- Kyoto Univ. (Japan)
For a given undirected graph G = (V, E, c{sub G}) with edges weighted by nonnegative reals c{sub G} : E {r_arrow} R{sup +}, let {lambda}{sub G}(k) stand for the minimum amount of weights to be added to make G k-edge-connected, and G*(k) be the resulting graph obtained from G. This paper shows that function AG over the entire range k {element_of} [0, +{infinity}] has at most n - 1 break points ans it can be computed in O(nm + n{sup 2} log n) time, where n and m are the numbers of vertices and edges, respectively.
- OSTI ID:
- 471722
- Report Number(s):
- CONF-970142--
- Country of Publication:
- United States
- Language:
- English
Similar Records
All pairs almost shortest paths
Computing vertex connectivity: New bounds from old techniques
Multiflows and matchings
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:457675
Computing vertex connectivity: New bounds from old techniques
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:457676
Multiflows and matchings
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36628