A Preemptive Algorithm for Maximizing Disjoint Paths on Trees.
Yossi AzarUriel FeigeDaniel GlasnerPublished in: Algorithmica (2010)
Keyphrases
- detection algorithm
- preprocessing
- k means
- optimization algorithm
- objective function
- recognition algorithm
- search space
- times faster
- np hard
- experimental evaluation
- computational cost
- similarity measure
- tree structure
- high accuracy
- matching algorithm
- clustering method
- cost function
- expectation maximization
- dynamic programming
- optimal solution
- undirected graph
- binary tree
- binary trees