Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities (Q3511369): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 00:24, 5 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities |
scientific article |
Statements
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities (English)
0 references
10 July 2008
0 references