Minimal Obstructions for Partial Representations of Interval Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43925017" target="_blank" >RIV/49777513:23520/14:43925017 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007/978-3-319-13075-0_32" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-319-13075-0_32</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-13075-0_32" target="_blank" >10.1007/978-3-319-13075-0_32</a>
Alternative languages
Result language
angličtina
Original language name
Minimal Obstructions for Partial Representations of Interval Graphs
Original language description
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 the remaining intervals can be added to create an extending representation. In this paper, we characterize the minimal obstructions which make a partial representation non-extendible. This generalizes Lekkerkerker and Boland's characterization of minimal forbidden induced subgraphs of interval graphs. Each minimal obstruction consists of a forbidden induced subgraph together with at most four pre-drawn intervals. A Helly-type result follows: A partial representation is extendible ifand only if every quadruple of pre-drawn intervals is extendible by itself. Our characterization leads to the first polynomial-time certifying algorithm for partial representation extension of intersection graphs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/EE2.3.30.0038" target="_blank" >EE2.3.30.0038: New excellence in human resources</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
8889
Issue of the periodical within the volume
2014
Country of publishing house
DE - GERMANY
Number of pages
13
Pages from-to
401-413
UT code for WoS article
000354865900032
EID of the result in the Scopus database
—