A polynomial time algorithm recognizing link trees.
Peter BugataAttila NagyRoman VávraPublished in: J. Graph Theory (1995)
Keyphrases
- computational complexity
- experimental evaluation
- high accuracy
- dynamic programming
- times faster
- k means
- learning algorithm
- detection algorithm
- computational cost
- significant improvement
- optimization algorithm
- preprocessing
- optimal solution
- tree structure
- matching algorithm
- ant colony optimization
- binary tree
- strongly polynomial
- segmentation algorithm
- theoretical analysis
- simulated annealing
- worst case
- np hard
- special case
- search space
- convergence rate
- approximation algorithms
- improved algorithm
- objective function
- similarity measure