Login / Signup
On testing single connectedness in directed graphs and some related problems.
Martin Dietzfelbinger
Raed Jaberi
Published in:
Inf. Process. Lett. (2015)
Keyphrases
</>
related problems
directed graph
random walk
directed acyclic graph
undirected graph
range searching
test cases
stable marriage
upper bound
connected components
broadly applicable
maximum flow
structured databases
lower bound
strongly connected