Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PLANAR DIGRAPHS:
Reports tagged with Planar Digraphs:
TR20-074 | 6th May 2020
Eric Allender, Archit Chauhan, Samir Datta

Depth-First Search in Directed Graphs, Revisited

We present an algorithm for constructing a depth-first search tree in planar digraphs; the algorithm can be implemented in the complexity class UL, which is contained in nondeterministic logspace NL, which in turn lies in NC^2. Prior to this (for more than a quarter-century), the fastest uniform deterministic parallel algorithm ... more >>>




ISSN 1433-8092 | Imprint