Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees.
Colette JohnenPublished in: PODC (1997)
Keyphrases
- memory efficient
- spanning tree
- depth first search
- detection algorithm
- times faster
- breadth first search
- learning algorithm
- matching algorithm
- dynamic programming
- np hard
- objective function
- expectation maximization
- minimum spanning tree
- optimal solution
- alpha beta
- multiple sequence alignment
- simulated annealing
- undirected graph