Deciding twin-width at most 4 is NP-complete - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Deciding twin-width at most 4 is NP-complete

Résumé

We show that determining if an n-vertex graph has twin-width at most 4 is NP-complete, and requires time 2 Ω(n/ log n) unless the Exponential-Time Hypothesis fails. Along the way, we give an elementary proof that n-vertex graphs subdivided at least 2 log n times have twin-width at most 4. We also show how to encode trigraphs H (2-edge colored graphs involved in the definition of twin-width) into graphs G, in the sense that every d-sequence (sequence of vertex contractions witnessing that the twin-width is at most d) of G inevitably creates H as an induced subtrigraph, whereas there exists a partial d-sequence that actually goes from G to H. We believe that these facts and their proofs can be of independent interest.
Fichier principal
Vignette du fichier
camera.pdf (757.96 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03750997 , version 1 (13-08-2022)

Identifiants

Citer

Pierre Bergé, Édouard Bonnet, Hugues Déprés. Deciding twin-width at most 4 is NP-complete. 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022), Jul 2022, Paris, France. ⟨10.4230/LIPIcs.ICALP.2022.18⟩. ⟨hal-03750997⟩
30 Consultations
20 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More