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

• 1 January 1986
• journal article
• Published by Springer Nature in Cybernetics and Systems Analysis
• Vol. 22  (2) , 156-162
• https://doi.org/10.1007/bf01074775

Abstract