Representing and enumerating edge connectivity cuts in RNC

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 519 LNCS, Issue , 1991, Pages 273-285

  Naor, Dalit ^a   Vazirani, Vijay V ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

EDGE CONNECTIVITY; EDGE-WEIGHTED GRAPH; FAST PARALLEL ALGORITHMS; SEQUENTIAL ALGORITHM; WEIGHTED GRAPH;

GRAPHIC METHODS;

EID: 85025261642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028269     Document Type: Conference Paper

References (19)

1. G.M. Adelson-Velskii, E.A. Dinits, A.V. Karzanov, Flow Algorithms [In Russian], Nauka, Moscow, 1976.
2. R.E. Bixby, The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds, Networks, Vol. 5, pp. 253-298, 1975.
3. M.O. Ball, J.S. Provan, Calculating Bounds on Reachability in Computer Networks, Networks, Vol. 18, pp. 1-12, 1988.
4. E.A. Dinits, A.V. Karzanov, M.V. Lomosonov, On the Structure of a Family of Minimal Weighted Cuts in a Graph, Studies in Discrete Optimization [In Russian], A.A. Fridman (Ed), Nauka, Moscow, pp. 290-306, 1976.
5. A.H. Esfahanian, S.L. Hakimi, On Computing the Connectivities of Graphs and Digraphs, Networks, Vol. 14 (1984), pp. 355-366.
6. S. Even, R.E. Tarjan, Network Flow and Testing Graph Connectivity, Siam J. Computing, Vol. 4, No. 4, pp. 507-518, 1975.
7. H. Gabow, A Matroid Approach to Finding Edge Connectivity and Packing Arborescences, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, pp. 112-122, 1991.
8. D. Gusfield, D. Naor, Extracting Maximal Information about Sets of Minimum Cuts, Tech. Report CSE-88-14, UC Davis.
9. A. Kanevsky, Graphs with Odd and Even Edge Connectivity are Inherently Different, Tech. Report TAMU-89-10, June 1989.
10. A. Kanevsky, On the Number of Minimum Size Separating Vertex Sets in a Graph and How to Find All of Them, Proc. of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, January 1990.
11. A.V. Karzanov, E.A. Timofeev, Efficient Algorithm for Finding all Minimal Edge Cuts of a Nonoriented Graph, Cybernetics, (1986) pp. 156-162, Translated from Kibernetika, No. 2, pp. 8-12, March-April 1986.
12. R.M. Karp, E. Upfal, A. Wigderson, Constructing a Perfect Matching is in Random NC, Combinatorica, 6(1) 1986, pp. 35-48.
13. D. Matula, Determining Edge Connectivity in O(nm), Proc. of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los-Angeles, pp. 249-251, 1987.
14. K. Mulmuley, U.V. Vazirani, V.V. Vazirani, Matching is As Easy As Matrix Inversion, Combinatorica, 7(1) 1987, pp. 105-113.
15. D. Naor, D. Gusfield, C. Martel, A Fast Algorithm for Optimally Increasing the Edge-Connectivity, Proc. of the 31th Annual IEEE Symposium on Foundations of Computer Science, St. Louis, pp. 698-707, 1990.
16. J.C. Picard, M. Queyranne, On the Structure of All Minimum Cuts in a Network and Applications, Mathematical Programming Study 13 (1980), 8-16.
17. J.C. Picard, M. Queyranne, Selected Applications of Minimum Cuts in Networks, INFOR — Can. J. Oper. Res. Inf. Process. 20 (1982), 394-422.
18. V.D. Podderyugin, An Algorithm for Finding the Edge Connectivity of Graphs, Vopr. Kibern., no. 2, 136 (1973).
19. J.S. Provan, D.R. Shier, A Paradigm for Listing (s,t)-Cuts in Graphs, Technical Report UNC/OR TR91-3, Department of Operations Research, University of North Carolina at Chapel Hill, February 1991.