) Algorithm for the Characteristic Polynomial of a Tree.
David Pokrass JacobsCatia Maria dos Santos MachadoVilmar TrevisanPublished in: Electron. Notes Discret. Math. (2001)
Keyphrases
- np hard
- tree structure
- dynamic programming
- theoretical analysis
- cost function
- experimental evaluation
- computational complexity
- learning algorithm
- k means
- preprocessing
- probabilistic model
- worst case
- high accuracy
- times faster
- segmentation algorithm
- improved algorithm
- polynomially bounded
- convergence rate
- minimum spanning tree
- matching algorithm
- detection algorithm
- optimization algorithm
- expectation maximization
- scheduling problem
- optimal solution
- objective function
- search space
- binary tree
- tree construction