Treewidth is NP-Complete on Cubic Graphs

Ordyniak, S. orcid.org/0000-0003-1935-651X, Bodlaender, H., Bonnet, É et al. (6 more authors) (2023) Treewidth is NP-Complete on Cubic Graphs. In: Dagstuhl Reports. IPEC 2023: International Symposium on Parameterized and Exact Computation, 06-08 Sep 2023, Amsterdam, Netherlands. Leibniz International Proceedings in Informatics (LIPIcs), 285 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern, Merzig-Wadern, Saarland , 7:1-7:13. ISBN 978-3-95977-305-8

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dušan Knop, Paloma T. Lima, Martin Milanič, Sebastian Ordyniak, Sukanya Pandey, and Ondřej Suchý; licensed under Creative Commons License CC-BY 4.0 .
Keywords: Treewidth, cubic graphs, degree, NP-completeness
Dates:
  • Accepted: 5 August 2023
  • Published (online): 13 December 2023
  • Published: 13 December 2023
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRC (Engineering and Physical Sciences Research Council)EP/V00252X/1
Depositing User: Symplectic Publications
Date Deposited: 10 Aug 2023 09:28
Last Modified: 16 Feb 2024 11:30
Published Version: https://drops.dagstuhl.de/entities/document/10.423...
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Series Name: Leibniz International Proceedings in Informatics (LIPIcs)
Identification Number: https://doi.org/10.4230/LIPIcs.IPEC.2023.7

Export

Statistics


CORE (COnnecting REpositories)