Logspace reduction of directed reachability for bounded genus graphs to the planar case

Jan Kyncl, Tomás Vyskocil. Logspace reduction of directed reachability for bounded genus graphs to the planar case. Electronic Colloquium on Computational Complexity (ECCC), 16:50, 2009. [doi]

Abstract

Abstract is missing.