k-Gap Interval Graphs

Details k-Gap Interval Graphs k-Gap Interval Graphs

2011-12-14

arxiv.org/abs/1112.3244v2

Computer Science

Data Structures and Algorithms

LATIN 2012

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

k-Gap Interval Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with k-Gap Interval Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-Gap Interval Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-227678