Computing All Small Cuts in an Undirected Network (Q4377436)
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 1116174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing All Small Cuts in an Undirected Network |
scientific article; zbMATH DE number 1116174 |
Statements
Computing All Small Cuts in an Undirected Network (English)
0 references
9 February 1998
0 references
minimum cuts
0 references
graphs
0 references
edge-splitting
0 references
polynomial algorithm
0 references
0.8856473
0 references
0 references
0 references
0.8743548
0 references
0.8683938
0 references
