k-Gap Interval Graphs release_3mih66goi5hcrpzuvn3kbrsb7i

by Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger

Released as a article .

2011  

Abstract

We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an interval associated to one vertex has a nonempty intersection with an interval associated to the other vertex. A graph on n vertices is a k-gap interval graph if it has a multiple interval representation with at most n+k intervals in total. In order to scale up the nice algorithmic properties of interval graphs (where k=0), we parameterize graph problems by k, and find FPT algorithms for several problems, including Feedback Vertex Set, Dominating Set, Independent Set, Clique, Clique Cover, and Multiple Interval Transversal. The Coloring problem turns out to be W[1]-hard and we design an XP algorithm for the recognition problem.
In text/plain format

Archived Files and Locations

application/pdf  237.7 kB
file_sj27xghenreydh3a6y7wyommbm
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  231.5 kB
file_kmomlhatfzaqdjbkne7fcmi4fe
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2011-12-16
Version   v2
Language   en ?
arXiv  1112.3244v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 26647c58-9d7b-4452-97f6-989e40948537
API URL: JSON