An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem.
Daniel Binkele-RaibleHenning FernauPublished in: J. Discrete Algorithms (2012)
Keyphrases
- k means
- high accuracy
- computational cost
- experimental evaluation
- segmentation algorithm
- dynamic programming
- learning algorithm
- significant improvement
- optimal solution
- optimization algorithm
- detection algorithm
- cost function
- search space
- preprocessing
- improved algorithm
- linear complexity
- theoretical analysis
- computationally efficient
- worst case
- np hard
- search algorithm
- input data
- probabilistic model
- tree structure
- classification algorithm
- times faster
- data clustering
- recognition algorithm
- computational complexity