An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks (Q3690541): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1137/0214023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989626562 / rank | |||
Normal rank | |||
Latest revision as of 00:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks |
scientific article |
Statements
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks (English)
0 references
1985
0 references
cut-condition
0 references
polynomial time
0 references
max flow-min cut theorem
0 references
multicommodity flows in planar graphs
0 references
algorithm
0 references
