Leslie M. Goldschlager, Ralph A. Shaw, John Staples. The Maximum Flow Problem is Log Space Complete for P. Theoretical Computer Science, 21:105-111, 1982.
@article{GoldschlagerSS82,
title = {The Maximum Flow Problem is Log Space Complete for P},
author = {Leslie M. Goldschlager and Ralph A. Shaw and John Staples},
year = {1982},
tags = {completeness, data-flow},
researchr = {https://researchr.org/publication/GoldschlagerSS82},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {21},
pages = {105-111},
}