Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case
Year: 2010
Type: article
Authors: Jan Kynčl, Tomáš Vyskočil
Institution: Charles University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: bounded genus graphs, NL, L, NL-completeness, torus
Open Access status: closed
OpenAlex ID: W296798544
