The Planar Multiterminal Cut Problem

  title={The Planar Multiterminal Cut Problem},
  author={David Hartvigsen},
  journal={Discrete Applied Mathematics},
Let G = (V, E) be a graph with positive edge weights and let V’ c V. The min VI-cut prohlenl is to find a minimum weight set E’ E E such that no two nodes of V’ occur in the same component of G’ = (V, E\E’). Our main results are two new structural theorems for optimal solutions to the min V-cut problem when G is planar. The first theorem establishes for the… CONTINUE READING