A Multiterminal Minimum Cut Algorithm for Planar Graphs
Yossi Shiloach · SIAM Journal on Computing · 1980
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
SIAM Journal on Computing · Society for Industrial and Applied Mathematics · article · 1980
Abstract
Given an undirected planar graph with n vertices, we present an $O((n\log n)^2 )$ algorithm which finds the minimum cuts between all the pairs of vertices.
Open the resolved locator · 10.1137/0209020
Metadata licence: OpenAlex metadata (CC0)