The complexity of minimum cut and maximum flow problems in an acyclic network (Q3792462): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3883524 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust linear algorithms for cutsets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707420 / rank | |||
Normal rank | |||
Latest revision as of 16:51, 18 June 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
