Recognizing d-Interval Graphs and d-Track Interval Graphs

A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval on each track. As generalizations of the ubiquitous interval graphs, d-interval graphs and d-track interval graphs have wide applications, traditionally to scheduling and resource allocation, and more recently to bioinformatics. In this paper, we prove that recognizing d-track interval graphs is NP-complete for any constant d 2. This confirms a conjecture of Gy

• Type: Conference
• Year: 2010
• Where: FAW
• Authors: Minghui Jiang
• Keywords: Algorithms, D-track Interval Graphs, FAW 2010, Interval Graphs, Ubiquitous Interval Graphs