The binary network flow problem is logspace complete for P
From MaRDI portal
Publication:914388
DOI10.1016/0304-3975(90)90101-MzbMath0701.68048MaRDI QIDQ914388
Klaus W. Wagner, Thomas Lengauer
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Related Items (2)
The computational complexity of graph problems with succinct multigraph representation ⋮ The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
Cites Work
This page was built for publication: The binary network flow problem is logspace complete for P
