Salembier's Min-tree algorithm turned into breadth first search.

Wim H. Hesselink

Published in: Inf. Process. Lett. (2003)

Keyphrases

breadth first search
tree structure
depth first search
computational complexity
objective function
search space
dynamic programming
convergence rate
recognition algorithm
optimal solution
optimization problems
spanning tree
routing problem
memory space
decomposition algorithm