![](/img/cover-not-exists.png)
Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
A. V. Karzanov, E. A. TimofeevVolume:
22
Language:
english
Pages:
7
DOI:
10.1007/bf01074775
Date:
March, 1986
File:
PDF, 524 KB
english, 1986