The maximum flow problem is log space complete for P

The space complexity of the maximum flow problem is investigated. It is shown that the problem is log space complete for deterministic polynomial time. Thus the maximum flow problem probably has no algorithm which needs only O(log k n) storage space for any constant k. Another consequence is that th...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 21; no. 1; pp. 105 - 111
Main Authors Goldschlager, Leslie M., Shaw, Ralph A., Staples, John
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.01.1982
Online AccessGet full text

Cover

More Information
Summary:The space complexity of the maximum flow problem is investigated. It is shown that the problem is log space complete for deterministic polynomial time. Thus the maximum flow problem probably has no algorithm which needs only O(log k n) storage space for any constant k. Another consequence is that there is probably no fast parallel algorithm for the maximum flow problem.
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(82)90092-5