Login / Signup
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search.
Pilar de la Torre
Clyde P. Kruskal
Published in:
Theory Comput. Syst. (2001)
Keyphrases
</>
depth first search
breadth first search
single source
search tree
tree search
graph search
branch and bound
search algorithm
routing problem
spanning tree
search space
np complete
computational complexity
special case
data management
search strategies