Treewidth Is NP-Complete on Cubic Graphs

DSpace/Manakin Repository

Treewidth Is NP-Complete on Cubic Graphs
 
Bodlaender, Hans L.; Bonnet, Édouard; Jaffke, Lars; Knop, Dusan; Lima, Paloma T.; Milanic, Martin; Ordyniak, Sebastian; Pandey, Sukanya; Suchý, Ondrej
(2023)
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, volume 285, pp. 7:1 - 7:13
Leibniz International Proceedings in Informatics, LIPIcs, volume 285, pp. 7:1 - 7:13
(Part of book)
Abstract
In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete on graphs with maximum degree at most 9. We add a new and simpler proof of the NP-completeness of treewidth, and show that Treewidth ... read more
Download/Full Text
Open Access version via Utrecht University Repository Publisher version
 
Keywords: NP-completeness, Treewidth, cubic graphs, degree, Software
DOI: https://doi.org/10.4230/LIPICS.IPEC.2023.7
ISSN: 1868-8969
ISBN: 9783959773058
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
Note: Publisher Copyright: © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
(Peer reviewed)
 
 
See more statistics about this item