Efficient algorithm for finding all minimal edge cuts of a nonoriented graph

Cybernetics

Volumn 22, Issue 2, 1986, Pages 156-162

  Karzanov, A V ^a   Timofeev, E A ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

COMPLEXITY; MINIMAL EDGE CUTS; NONORIENTED GRAPH;

MATHEMATICAL TECHNIQUES;

EID: 0022678245     PISSN: 00114235     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/BF01074775     Document Type: Article

References (6)

1. An algorithm for finding the edge connectivity of graphs
2. An algorithm for constructing minimax k-connected oriented graphs
3. On the structure of a system of minimal edge cuts of a graph