DROPS

Document

DOI: 10.4230/LIPIcs.ISAAC.2016.45

On the Classes of Interval Graphs of Limited Nesting and Count of Lengths

Authors: Pavel Klavík, Yota Otachi, and Jiri Šejnoha

Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)

Abstract

In 1969, Roberts introduced proper and unit interval graphs and proved that these classes are equal. Natural generalizations of unit interval graphs called k-length interval graphs were considered in which the number of different lengths of intervals is limited by k. Even after decades of research, no insight into their structure is known and the complexity of recognition is open even for k = 2. We propose generalizations of proper interval graphs called k-nested interval graphs in which there are no chains of k + 1 intervals nested in each other. It is easy to see that k-nested interval graphs are a superclass of k-length interval graphs. We give a linear-time recognition algorithm for k-nested interval graphs. This algorithm adds a missing piece to Gajarský et al. [FOCS 2015] to show that testing FO properties on interval graphs is FPT with respect to the nesting k and the length of the formula, while the problem is W[2]-hard when parameterized just by the length of the formula. Further, we show that a generalization of recognition called partial representation extension is polynomial-time solvable for k-nested interval graphs, while it is NP-hard for k-length interval graphs, even when k = 2.

Cite as

Pavel Klavík, Yota Otachi, and Jiri Šejnoha. On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 45:1-45:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{klavik_et_al:LIPIcs.ISAAC.2016.45,
  author =	{Klav{\'\i}k, Pavel and Otachi, Yota and \v{S}ejnoha, Jiri},
  title =	{{On the Classes of Interval Graphs of Limited Nesting and Count of Lengths}},
  booktitle =	{27th International Symposium on Algorithms and Computation (ISAAC 2016)},
  pages =	{45:1--45:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-026-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{64},
  editor =	{Hong, Seok-Hee},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.45},
  URN =		{urn:nbn:de:0030-drops-68155},
  doi =		{10.4230/LIPIcs.ISAAC.2016.45},
  annote =	{Keywords: interval graphs, proper and unit interval graphs, recognition, partial representation extension}
}

Search Results

Documents authored by Šejnoha, Jiri

On the Classes of Interval Graphs of Limited Nesting and Count of Lengths

Abstract

Cite as

Thanks for your feedback!

Could not send message