The complexity of minimum cut and maximum flow problems in an acyclic network
From MaRDI portal
Publication:3792462
DOI10.1002/net.3230170403zbMath0647.90033OpenAlexW2955437773MaRDI QIDQ3792462
Publication date: 1987
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230170403
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Related Items
The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem ⋮ Resilient capacity-aware routing
Cites Work
This page was built for publication: The complexity of minimum cut and maximum flow problems in an acyclic network