Extending Partial Representations of Circle Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10190237" target="_blank" >RIV/00216208:11320/13:10190237 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-319-03841-4_12" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-03841-4_12</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-03841-4_12" target="_blank" >10.1007/978-3-319-03841-4_12</a>
Alternative languages
Result language
angličtina
Original language name
Extending Partial Representations of Circle Graphs
Original language description
We give a polynomial-time algorithm for extending partial representations of circle graphs. Our result is based on a generalization of split decomposition which captures all representations of a given circle graph.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
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
Lecture Notes in Computer Science
ISBN
978-3-319-03840-7
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
131-142
Publisher name
Springer International Publishing
Place of publication
Neuveden
Event location
Bordeaux (Talence), France
Event date
Sep 23, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—