Planar depth-first search in $O(\log n)$ parallel time
Torben Hagerup
SIAM J. Computing
19:678–704, 1990
Cites:
Parallel algorithmic techniques for combinatorial computation
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine