Conference

Treewidth Is NP-Complete on Cubic Graphs ...

Bibliographic Details
Title: Treewidth Is NP-Complete on Cubic Graphs ...
Authors: Bodlaender, Hans L., Bonnet, Édouard, Jaffke, Lars, Knop, Dušan, Lima, Paloma T., Milanič, Martin, Ordyniak, Sebastian, Pandey, Sukanya, Suchý, Ondřej
Publisher Information: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Publication Year: 2023
Collection: DataCite Metadata Store (German National Library of Science and Technology)
Subject Terms: Treewidth, cubic graphs, degree, NP-completeness, Theory of computation → Problems, reductions and completeness
Description: 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 remains NP-complete on subcubic induced subgraphs of the infinite 3-dimensional grid. ... : LIPIcs, Vol. 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), pages 7:1-7:13 ...
Document Type: conference object
article in journal/newspaper
File Description: application/pdf
Language: English
Relation: https://dx.doi.org/10.4230/LIPIcs.IPEC.2023; https://dx.doi.org/10.1137/0608024; https://dx.doi.org/10.1137/0607033; https://dx.doi.org/10.1016/S0304-3975(97)00228-4; https://dx.doi.org/10.1016/S0166-218X(97)00031-0; https://dx.doi.org/10.1016/0020-0190(92)90234-M; https://dx.doi.org/10.1016/0304-3975(88)90028-X; https://dx.doi.org/10.1007/BF01215352
DOI: 10.4230/lipics.ipec.2023.7
DOI: 10.4230/LIPIcs.IPEC.2023.7
Availability: https://doi.org/10.4230/lipics.ipec.2023.710.4230/LIPIcs.IPEC.202310.1137/060802410.1137/060703310.1016/S0304-3975(97)00228-410.1016/S0166-218X(97)00031-010.1016/0020-0190(92)90234-M10.1016/0304-3975(88)90028-X10.1007/BF01215352
Rights: info:eu-repo/semantics/openAccess ; Creative Commons Attribution 4.0 International license ; https://creativecommons.org/licenses/by/4.0/legalcode ; cc by 4.0
Accession Number: edsbas.6662CE8A
Database: BASE
Description
Description not available.