Simple realizability of complete abstract topological graphs in P

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10080461" target="_blank" >RIV/00216208:11320/11:10080461 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00454-010-9320-x" target="_blank" >http://dx.doi.org/10.1007/s00454-010-9320-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00454-010-9320-x" target="_blank" >10.1007/s00454-010-9320-x</a>

Result language
angličtina
Original language name
Simple realizability of complete abstract topological graphs in P
Original language description
An abstract topological graph (briefly an AT-graph) is a pair A=(G,R) where G=(V,E) is a graph and R is a set of pairs of its edges. An AT-graph A is simply realizable if G can be drawn in the plane in such a way that each pair of edges from R crosses exactly once and no other pair crosses. We present a polynomial algorithm which decides whether a given complete AT-graph is simply realizable. On the other hand, we show that other similar realizability problems for (complete) AT-graphs are NP-hard.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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)

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

Similar results(10)