The complexity of minimum cut and maximum flow problems in an acyclic network (Q3792462): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:47, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of minimum cut and maximum flow problems in an acyclic network |
scientific article |
Statements
The complexity of minimum cut and maximum flow problems in an acyclic network (English)
0 references
1987
0 references
minimum cut
0 references
maximum flow
0 references
acyclic network
0 references
