Subexponential time algorithms for finding small tree and path decompositions.
Hans L. BodlaenderJesper NederlofPublished in: CoRR (2016)
Keyphrases
- learning algorithm
- optimization problems
- times faster
- orders of magnitude
- theoretical analysis
- computationally efficient
- worst case
- computational cost
- computational complexity
- nearest neighbor
- data sets
- significant improvement
- benchmark datasets
- search algorithm
- data mining algorithms
- computational efficiency
- hierarchical structure
- bayesian networks
- tree mining