Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network (Q4275336): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jagm.1993.1048 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1993.1048 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044614658 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JAGM.1993.1048 / rank | |||
Normal rank | |||
Latest revision as of 14:52, 29 December 2024
scientific article; zbMATH DE number 484752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network |
scientific article; zbMATH DE number 484752 |
Statements
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network (English)
0 references
13 January 1994
0 references
minimum-cost maximum flow
0 references
series-parallel network
0 references
balanced search tree
0 references
