The binary network flow problem is logspace complete for P
type: Item
instance of: scholarly article
title: The binary network flow problem is logspace complete for P
zbMATH Open document ID: 0701.68048
DOI: 10.1016/0304-3975(90)90101-M
author: Thomas Lengauer
author: K. W. Wagner
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 4149562
zbMATH Keywords: logspace complete
zbMATH Keywords: maximum flow
MaRDI profile type: Publication
cites work: Constant Depth Reducibility
cites work: Q4128417
cites work: The maximum flow problem is log space complete for P
cites work: Q3759947
Recommended article: Q3790655
Recommended article: Approximating the minimum-cost maximum flow is P-complete
Recommended article: Log/sub 2/ (N, m, p) strictly nonblocking networks
Recommended article: Some Network Flow Problems Solved with Pseudo-Boolean Programming
Recommended article: A polynomial time solvable concave network flow problem
Recommended article: An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
Recommended article: Network flow and 2-satisfiability
Recommended article: A fast polynomial time algorithm for logistics network flows
Recommended article: On the computational behavior of a polynomial-time network flow algorithm
Recommended article: AO(nm log(U/n)) time maximum flow algorithm
description: scientific article; zbMATH DE number 4149562