The Maximum Flow Problem is Log Space Complete for P

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.

Possibly Related Publications

The following publications are possibly variants of this publication: