Parallel algorithms for minimum cuts and maximum flows in planar networks", Proc. 23-rd Area (1982)

by D B Johnson, S W Venkatesan
Venue:Center for Research ~n Computer Technology, Aiken Compute, an Laboratory. Harvard University