The Maximum Flow Problem is Log Space Complete for P. - Leslie M. Goldschlager; Ralph A. Shaw; John Staples (Theor. Comput. Sci., 1982)