The first fully polynomial stabilizing algorithm for BFS tree construction.
Alain CournierStephane RovedakisVincent VillainPublished in: Inf. Comput. (2019)
Keyphrases
- tree construction
- np hard
- learning algorithm
- optimal solution
- detection algorithm
- k means
- dynamic programming
- depth first search
- cost function
- worst case
- data sets
- computational complexity
- segmentation algorithm
- input data
- breadth first search
- expectation maximization
- simulated annealing
- lower bound
- search algorithm
- objective function
- data mining