I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.

Lars Arge Norbert Zeh

Published in: FOCS (2003)

Keyphrases

depth first search
planar graphs
breadth first search
search tree
routing problem
connected components
branch and bound
tree search
search algorithm
genetic algorithm
data streams
high dimensional
undirected graph