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.

Authors

Leslie M. Goldschlager

This author has not been identified. Look up 'Leslie M. Goldschlager' in Google

Ralph A. Shaw

This author has not been identified. Look up 'Ralph A. Shaw' in Google

John Staples

This author has not been identified. Look up 'John Staples' in Google