<p>I am interested in the following problem.</p>
<p><strong>Node Multiway Cut on Planar Graphs with terminals on the outer face</strong></p>
<ul>
<li>Instance: A plane graph G, and integer k, and a set <span class="math-container">$S \subseteq V(G)$</span> of terminals which are all incident on the outer face of G.</li>
<li>Question: Is there a set of vertices <span class="math-container">$X \subseteq V(G)$</span> of size at most <span class="math-container">$k$</span> such that all vertices of <span class="math-container">$S \setminus X$</span> belong to different connected components of <span class="math-container">$G - X$</span>?</li>
</ul>
<p>Informally, the problem asks whether all terminals can be separated with k vertex deletions, knowing that all terminals lie on the outer face. If we replace vertex deletions by edge deletions, then this is known to be possible in polynomial time by considering multiway cuts in the planar dual, and relating them to certain kind of Steiner trees (<a href="https://doi.org/10.1007/3-540-45678-3_29" rel="nofollow noreferrer">Efficient Algorithms for k-Terminal Cuts on
Planar Graphs</a>). Since the edge-deletion version reduces to the vertex-deletion version, the edge-deletion version seems easier; no reduction in the reverse direction is known.</p>
<p>The question is: is Node Multiway Cut on Planar Graphs with terminals on the outer face NP-complete? The reason I am interested in this problem is that it would provide me with a starting point for another complexity lower bound if this is indeed NP-complete.</p>

CC BY-SA 3.0
2011-11-15T02:26:13.597Z
I think that this is equivalent to solving vertex weighted Steiner tree where all terminals on the outer face. The very loose idea would be something like: consider the boundary path between every pair of consecutive terminals you want to separate; connect all the vertices on that path to a new vertex, which becomes a terminal for the Steiner tree problem. Now all these Steiner terminals will all lie on the same face. This should be solvable in polynomial time using the algorithm of Erickson et al. (http://www.jstor.org/pss/3689922).
zotachidil
CC BY-SA 3.0
2011-11-15T02:28:40.257Z
I know for sure that the algorithm I mentioned works for edge weighted Steiner tree, but one should be able to adapt it to work for vertices.
zotachidil
<cc.complexity-theory><np-hardness><planar-graphs>
Is Node Multiway Cut NP-complete on planar graphs when all terminals lie on the outer face?
Bart Jansen
# Is Node Multiway Cut NP-complete on planar graphs when all terminals lie on the outer face?

(Asked by: username_0 on 2011-11-14)

I am interested in the following problem.

**Node Multiway Cut on Planar Graphs with terminals on the outer face**

* Instance: A plane graph G, and integer k, and a set $S \subseteq V(G)$ of terminals which are all incident on the outer face of G.
* Question: Is there a set of vertices $X \subseteq V(G)$ of size at most $k$ such that all vertices of $S \setminus X$ belong to different connected components of $G - X$?

Informally, the problem asks whether all terminals can be separated with k vertex deletions, knowing that all terminals lie on the outer face. If we replace vertex deletions by edge deletions, then this is known to be possible in polynomial time by considering multiway cuts in the planar dual, and relating them to certain kind of Steiner trees ([Efficient Algorithms for k-Terminal Cuts on
Planar Graphs](https://doi.org/10.1007/3-540-45678-3_29)). Since the edge-deletion version reduces to the vertex-deletion version, the edge-deletion version seems easier; no reduction in the reverse direction is known.

The question is: is Node Multiway Cut on Planar Graphs with terminals on the outer face NP-complete? The reason I am interested in this problem is that it would provide me with a starting point for another complexity lower bound if this is indeed NP-complete.

**Tags:** cc.complexity-theory, np-hardness, planar-graphs
> **Comments:**
> **username_1**: I think that this is equivalent to solving vertex weighted Steiner tree where all terminals on the outer face. The very loose idea would be something like: consider the boundary path between every pair of consecutive terminals you want to separate; connect all the vertices on that path to a new vertex, which becomes a terminal for the Steiner tree problem. Now all these Steiner terminals will all lie on the same face. This should be solvable in polynomial time using the algorithm of Erickson et al. (http://www.jstor.org/pss/3689922).  
> **username_1**: I know for sure that the algorithm I mentioned works for edge weighted Steiner tree, but one should be able to adapt it to work for vertices.  

---

## 0 answers

