Minimum-cost dynamic flows: The series-parallel case (Q4474291): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4737515 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4471275 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4449191 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3128904 / rank | |||
Normal rank | |||
Revision as of 18:33, 6 June 2024
scientific article; zbMATH DE number 2081223
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-cost dynamic flows: The series-parallel case |
scientific article; zbMATH DE number 2081223 |
Statements
Minimum-cost dynamic flows: The series-parallel case (English)
0 references
4 August 2004
0 references
minimum-cost flow
0 references
dynamic network flow
0 references
greedy algorithm
0 references
two-terminal series parallel networks
0 references
