Parallel algorithms for minimum cuts and maximum flows in planar networks | IEEE Conference Publication | IEEE Xplore