An efficient network flow code for finding all minimum cost \(s-t\) cutsets (Q5952784): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:47, 4 March 2024
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
