Edge Multiway Cut and Node Multiway Cut are NP-complete on Subcubic Graphs

Johnson, Matthew S.; Martin, Barnaby; Smith, Siani; Pandey, Sukanya; Paulusma, Daniël; van Leeuwen, Erik Jan

doi:https://doi.org/10.48550/arXiv.2211.12203

Edge Multiway Cut and Node Multiway Cut are NP-complete on Subcubic Graphs

DSpace/Manakin Repository

Edge Multiway Cut and Node Multiway Cut are NP-complete on Subcubic Graphs

Johnson, Matthew S.; Martin, Barnaby; Smith, Siani; Pandey, Sukanya; Paulusma, Daniël; van Leeuwen, Erik Jan

(2022) Utrecht University Repository

(Preprint)

Abstract

We show that Edge Multiway Cut (also called Multiterminal Cut) and Node Multiway Cut are NP-complete on graphs of maximum degree 3 (also known as subcubic graphs). This improves on a previous degree bound of 11. Our NP-completeness result holds even for subcubic graphs that are planar.

Download/Full Text

Open Access version via Utrecht University Repository

Preprint

DOI: https://doi.org/10.48550/arXiv.2211.12203

Publisher: arXiv

See more statistics about this item