Can A Maximum Flow be Computed on o(nm) Time?

Joseph Cheriyan Torben Hagerup Kurt Mehlhorn

Published in: ICALP (1990)

Keyphrases

maximum flow
minimum cut
directed graph
flow network
push relabel
random walk
directed networks