Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
Anders DessmarkJesper JanssonAndrzej LingasEva-Marta LundellPublished in: CPM (2004)
Keyphrases
- computational complexity
- worst case
- times faster
- computationally efficient
- graph theory
- recently developed
- significant improvement
- optimization problems
- computational cost
- theoretical analysis
- benchmark datasets
- linear programming
- computational efficiency
- combinatorial optimization
- data structure
- partial order
- database