Efficient algorithm for finding all minimal edge cuts of a nonoriented graph (Q3032277)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithm for finding all minimal edge cuts of a nonoriented graph |
scientific article |
Statements
Efficient algorithm for finding all minimal edge cuts of a nonoriented graph (English)
0 references
1986
0 references
algorithm
0 references
minimal edge cut
0 references
