Minimal Obstructions for Partial Representations of Interval Graphs

@article{Klavk2014MinimalOF,
  title={Minimal Obstructions for Partial Representations of Interval Graphs},
  author={Pavel Klav{\'i}k and Maria Saumell},
  journal={CoRR},
  year={2014},
  volume={abs/1406.6228}
}
Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether we can add the remaining intervals and construct an extending representation. Two linear-time algorithms are known for solving this problem. In this paper, we characterize the minimal obstructions which make a partial… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS