A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
Daniel RaibleHenning FernauPublished in: CoRR (2009)
Keyphrases
- computational complexity
- computationally efficient
- k means
- dynamic programming
- computational cost
- times faster
- high accuracy
- experimental evaluation
- detection algorithm
- matching algorithm
- expectation maximization
- improved algorithm
- cost function
- objective function
- convergence rate
- spanning tree
- brute force
- learning algorithm
- memory efficient
- theoretical analysis
- worst case
- segmentation algorithm
- clustering method
- pattern matching
- particle swarm optimization
- combinatorial optimization
- data clustering
- input data
- recognition algorithm
- highly efficient
- significant improvement
- search space
- bayesian networks