Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniel, Paulusma, Erik Jan van Leeuwen
TL;DR
This paper proves that both Edge Multiway Cut and Node Multiway Cut problems are NP-complete even on subcubic and planar graphs, significantly reducing the maximum degree bound from 11 to 3.
Contribution
The paper establishes NP-completeness of these problems on subcubic and planar graphs, improving previous degree bounds and extending the understanding of their computational hardness.
Findings
NP-completeness on subcubic graphs
NP-completeness on planar graphs
Degree bound improved from 11 to 3
Abstract
We show that Edge Multiway Cut (also called Multiterminal Cut) and Node Multiway Cut are NP-complete on graphs of maximum degree (also known as subcubic graphs). This improves on a previous degree bound of . Our NP-completeness result holds even for subcubic graphs that are planar.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Optimization and Search Problems