An efficient network flow code for finding all minimum cost \(s-t\) cutsets (Q5952784): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126657768 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(00)00058-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2100534385 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 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
