most citedA near-linear time minimum Steiner cut algorithm for planar graphs

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2019★ 2 cited

A near-linear time minimum Steiner cut algorithm for planar graphs

Stephen Jue, Philip N. Klein

We consider the Minimum Steiner Cut problem on undirected planar graphs with non-negative edge weights. This problem involves finding the minimum cut of the graph that separates a…