Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph (Q3945967)
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 3763697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph |
scientific article; zbMATH DE number 3763697 |
Statements
Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph (English)
0 references
1982
0 references
efficient enumeration algorithm
0 references
minimal cut-sets
0 references
undirected graph
0 references
blocking mechanism
0 references
algorithm
0 references
computer implementation
0 references
