Extending Partial Representations of Proper and Unit Interval Graphs

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Extending Partial Representations of Proper and Unit Interval Graphs

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Extending Partial Representations of Proper and Unit Interval Graphs

Popis výsledku anglicky

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

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops

ISBN

978-3-319-08403-9

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

12

Strana od-do

253-264

Název nakladatele

SPRINGER

Místo vydání

Heidelberg New York Dordrecht London

Místo konání akce

Copenhagen

Datum konání akce

2. 7. 2014

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—