Cubic Plane Graphs on a Given Point Set
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10127504" target="_blank" >RIV/00216208:11320/12:10127504 - isvavai.cz</a>
Result on the web
<a href="http://dl.acm.org/ft_gateway.cfm?id=2261281&ftid=1240085&dwn=1&CFID=261492957&CFTOKEN=16910344" target="_blank" >http://dl.acm.org/ft_gateway.cfm?id=2261281&ftid=1240085&dwn=1&CFID=261492957&CFTOKEN=16910344</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2261250.2261281" target="_blank" >10.1145/2261250.2261281</a>
Alternative languages
Result language
angličtina
Original language name
Cubic Plane Graphs on a Given Point Set
Original language description
We give the first polynomial-time algorithm for deciding whether there is a cubic plane straight-line graph on a given finite point set in general position in the plane. If such a plane graph exists, it is found in cubic time.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
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
Proc. ACM Symposium on Computational Geometry (SoCG) 2012
ISBN
978-1-4503-1299-8
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
201-208
Publisher name
Association for Computing Machinery
Place of publication
New York, USA
Event location
Chapel Hill, NC, USA
Event date
Jun 17, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—