• DOI:10.1007/978-3-642-29344-3_30
Corpus ID: 2008361

k-Gap Interval Graphs

@inproceedings{Fomin2012kGapIG,
  title={k-Gap Interval Graphs},
  author={F. Fomin and Serge Gaspers and P. A. Golovach and K. Suchan and Stefan Szeider and E. V. Leeuwen and M. Vatshelle and Yngve Villanger},
  booktitle={LATIN},
  year={2012}
}

F. Fomin, Serge Gaspers, +5 authors Yngve Villanger

Published in LATIN 2012

Mathematics, Computer Science

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed