Extending Partial Representations of Proper and Unit Interval Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10287460" target="_blank" >RIV/00216208:11320/14:10287460 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-08404-6_22" target="_blank" >http://dx.doi.org/10.1007/978-3-319-08404-6_22</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-08404-6_22" target="_blank" >10.1007/978-3-319-08404-6_22</a>
Alternative languages
Result language
angličtina
Original language name
Extending Partial Representations of Proper and Unit Interval Graphs
Original language description
The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can be extended to a representation of the entire graph. In this paper, we give a linear-time algorithm for extending proper interval representations and an almost quadratic-time algorithm for extending unit interval representations. We also introduce the more general problem of bounded representations of unit interval graphs, where the input constrains the positions of intervals by lower and upper bounds. We show that this problem is -complete for disconnected input graphs and give a polynomial-time algorithm for a special class of instances, where the ordering of the connected components of the input graph along the real line is fixed. This includes the case of partial representation extension. The hardness result sharply contrasts the recent polynomial-time algorithm for bounded representations of pro
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
S - Specificky vyzkum na vysokych skolach
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
Article name in the collection
Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops
ISBN
978-3-319-08403-9
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
253-264
Publisher name
SPRINGER
Place of publication
Heidelberg New York Dordrecht London
Event location
Copenhagen
Event date
Jul 2, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—