Article Dans Une Revue Discrete Applied Mathematics Année : 2025

Recognizing unit multiple intervals is hard

Résumé

Multiple interval graphs are a well-known generalization of interval graphs introduced in the 1970s to deal with situations arising naturally in scheduling and allocation. A $d$-interval is the union of $d$ intervals on the real line, and a graph is a $d$-interval graph if it is the intersection graph of $d$-intervals. In particular, it is a unit $d$-interval graph if it admits a $d$-interval representation where every interval has unit length. Whereas it has been known for a long time that recognizing 2-interval graphs and other related classes such as 2-track interval graphs is NP-complete, the complexity of recognizing unit 2-interval graphs remains open. Here, we settle this question by proving that the recognition of unit 2-interval graphs is also NP-complete. Our proof technique uses a completely different approach from the other hardness results of recognizing related classes. Furthermore, we extend the result for unit $d$-interval graphs for any $d\geq 2$, which does not follow directly in graph recognition problems --as an example, it took almost 20 years to close the gap between $d=2$ and $d> 2$ for the recognition of $d$-track interval graphs. Our result has several implications, including that recognizing $(x, \dots, x)$ $d$-interval graphs and depth $r$ unit 2-interval graphs is NP-complete for every $x\geq 11$ and every $r\geq 4$.
Fichier principal
Vignette du fichier
2309.11908v1.pdf (797.11 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04875768 , version 1 (09-01-2025)

Identifiants

Citer

Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette. Recognizing unit multiple intervals is hard. Discrete Applied Mathematics, 2025, 360, pp.258-274. ⟨10.48550/arXiv.2309.11908⟩. ⟨hal-04875768⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More