Efficient algorithm for finding all minimal edge cuts of a nonoriented graph (Q3032277)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4130408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithm for finding all minimal edge cuts of a nonoriented graph |
scientific article; zbMATH DE number 4130408 |
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
0.787431001663208
0 references
0.7783676981925964
0 references
0.7745054364204407
0 references
