Login / Signup
Memory-efficient self-stabilizing algorithm to construct BFS spanning trees.
Colette Johnen
Published in:
WSS (1997)
Keyphrases
</>
memory efficient
spanning tree
learning algorithm
optimal solution
k means
times faster
search space
breadth first search
dynamic programming
detection algorithm
objective function
external memory
minimum spanning tree
simulated annealing
worst case
np hard
depth first search
algorithms require
total length