Extracting maximal information about sets of minimum cuts (Q1261290)
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: Extracting maximal information about sets of minimum cuts |
scientific article; zbMATH DE number 404618
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extracting maximal information about sets of minimum cuts |
scientific article; zbMATH DE number 404618 |
Statements
Extracting maximal information about sets of minimum cuts (English)
0 references
1 September 1993
0 references
minimum edge cuts
0 references
weighted, undirected graph
0 references
directed acyclic graph
0 references
unweighted graph
0 references
edge-connectivity cuts
0 references
network reliability
0 references
0 references
