Testing Planarity of Partially Embedded Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10057007" target="_blank" >RIV/00216208:11320/10:10057007 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Testing Planarity of Partially Embedded Graphs
Original language description
We present a linear time algorithm for deciding if a planar embedding of a part of graph can be extended to a noncrossing embedding of the entire graph. We further who that several optimization extensions of this problem are NP-complete.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010
ISBN
978-0-89871-701-3
ISSN
—
e-ISSN
—
Number of pages
20
Pages from-to
—
Publisher name
ACM-SIAM
Place of publication
New York
Event location
Austin, USA
Event date
Jan 17, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000280699900019