A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves.
Paul S. BonsmaTobias BrüggemannGerhard J. WoegingerPublished in: MFCS (2003)
Keyphrases
- spanning tree
- cost function
- worst case
- computational complexity
- preprocessing
- k means
- learning algorithm
- detection algorithm
- dynamic programming
- objective function
- memory efficient
- neural network
- optimization algorithm
- method finds
- times faster
- matching algorithm
- edge disjoint
- significant improvement
- search space
- expectation maximization
- computational cost
- np hard
- special case
- convergence rate
- optimal solution
- similarity measure
- decision trees