An efficient network flow code for finding all minimum cost \(s-t\) cutsets (Q5952784)
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: An efficient network flow code for finding all minimum cost \(s-t\) cutsets |
scientific article; zbMATH DE number 1693264
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient network flow code for finding all minimum cost \(s-t\) cutsets |
scientific article; zbMATH DE number 1693264 |
Statements
An efficient network flow code for finding all minimum cost \(s-t\) cutsets (English)
0 references
2002
0 references
cutset algorithms
0 references
directed graph
0 references
network
0 references
