Representing and Enumerating Edge Connectivity Cuts in RNC

@inproceedings{Naor1991RepresentingAE,
  title={Representing and Enumerating Edge Connectivity Cuts in RNC},
  author={Dalit Naor and Vijay V. Vazirani},
  booktitle={WADS},
  year={1991}
}
An undirected edge-weighted graph can have at most n2 edge connectivity cuts. A succinct and algorithmically useful representation for this set of cuts was given by [4], and an e cient sequential algorithm for obtaining it was given by [12]. In this paper, we present a fast parallel algorithm for obtaining this representation; our algorithm is an RNC algorithm in case the weights are given in unary. We also observe that for a unary weighted graph, the problems of counting and enumerating the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

E cient Algorithm for Finding all Minimal Edge Cuts of a Nonoriented Graph

A. V. Karzanov, E. A. Timofeev
Cybernetics • 1986
View 12 Excerpts
Highly Influenced

On the Structure of All Minimum Cuts in a Network and Applications

J.C.Picard, M. Queyranne
Mathematical Programming Study • 1980
View 4 Excerpts
Highly Influenced

On the Structure of a Family of Min- imal Weighted Cuts in a Graph

E. A. Dinits, A. V. Karzanov, M. V. Lomosonov
\Studies in Discrete Optimization" [In Russian] (A.A. Fridman Ed), pp. 290-306, Nauka, Moscow • 1976
View 11 Excerpts
Highly Influenced

D

D. Naor
Gus eld, C. Martel, A Fast Algorithm for Optimally Increasing the Edge- Connectivity, in Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, St. Louis • 1990
View 3 Excerpts

Graphs with Odd and Even Edge Connectivity are Inherently Di erent

A. Kanevsky
Technical Report TAMU-89-10, • 1989
View 2 Excerpts

Calculating Bounds on Reachability in Computer Networks

M. O. Ball, J. S. Provan
Networks 18 • 1988
View 2 Excerpts

Determining edge connectivity in 0(nm)

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) • 1987
View 1 Excerpt

Similar Papers

Loading similar papers…