Logspace reduction of directed reachability for bounded genus graphs to the planar case
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10030359" target="_blank" >RIV/00216208:11320/10:10030359 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Logspace reduction of directed reachability for bounded genus graphs to the planar case
Original language description
We show that reachability in directed graphs embedded on a fixed surface of arbitrary genus is logspace-reducible to reachability in directed graphs embedded in the plane.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
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)
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
Name of the periodical
ACM Transactions on Computation Theory
ISSN
1942-3454
e-ISSN
—
Volume of the periodical
1
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
11
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—