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

arxiv（2022）

引用 0|浏览18

暂无评分

摘要

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.

查看译文

关键词

node multiway cut,edge multiway cut,np-complete

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要