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

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