Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Viet Tung HoangWing-Kin SungPublished in: CoRR (2008)
Keyphrases
- computational complexity
- orders of magnitude
- data mining
- theoretical analysis
- computationally efficient
- computational cost
- worst case
- recently developed
- times faster
- computationally expensive
- optimization problems
- special case
- data structure
- learning algorithm
- neural network
- upper bound
- real time
- np complete
- significant improvement
- evolutionary algorithm
- constraint satisfaction problems
- machine learning algorithms
- benchmark datasets
- image processing