Counting the number of minimum cuts in undirected multigraphs (Q3987534)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting the number of minimum cuts in undirected multigraphs |
scientific article; zbMATH DE number 31322
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting the number of minimum cuts in undirected multigraphs |
scientific article; zbMATH DE number 31322 |
Statements
Counting the number of minimum cuts in undirected multigraphs (English)
0 references
28 June 1992
0 references
edge-connectivity
0 references
minimum cut
0 references
polynomial-time algorithm
0 references
spanning forest
0 references
spanning subgraph
0 references
edge contraction
0 references
number of cuts with minimum cardinality
0 references
undirected multigraph
0 references
stochastic graph
0 references
multiple graph
0 references
0.93979746
0 references
0.9106439
0 references
0.90675235
0 references
0.90579534
0 references
0 references
0.9043504
0 references
0.90434515
0 references
0.8982631
0 references
