Login / Signup
A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search.
K. B. Lakshmanan
N. Meenakshi
Krishnaiyan Thulasiraman
Published in:
Inf. Process. Lett. (1987)
Keyphrases
</>
depth first search
optimal solution
dynamic programming
breadth first search
worst case
search tree
routing problem
search space
cost function
branch and bound
data structure
search algorithm
particle swarm optimization
benchmark problems
memory space
iterative deepening
objective function