A blossoming algorithm for tree volumes of composite digraphs.
Victor J. W. GuoPublished in: Adv. Appl. Math. (2003)
Keyphrases
- np hard
- tree structure
- improved algorithm
- computationally efficient
- experimental evaluation
- high accuracy
- learning algorithm
- optimization algorithm
- dynamic programming
- pruning algorithm
- data sets
- binary tree
- simulated annealing
- worst case
- cost function
- objective function
- theoretical analysis
- detection algorithm
- preprocessing
- times faster
- significant improvement
- clustering method
- matching algorithm
- convergence rate
- optimal solution
- equivalence classes
- similarity measure