The complexity of minimum cut and maximum flow problems in an acyclic network (Q3792462): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users 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.1002/net.3230170403 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2955437773 / rank | |||
Normal rank | |||
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 17: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