A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
Shuji IsobeXiao ZhouTakao NishizekiPublished in: WG (1998)
Keyphrases
- computational complexity
- learning algorithm
- experimental evaluation
- tree structure
- np hard
- k means
- significant improvement
- simulated annealing
- high accuracy
- worst case
- cost function
- times faster
- recognition algorithm
- optimal solution
- computational cost
- convergence rate
- binary tree
- strongly polynomial
- dynamic programming
- preprocessing
- theoretical analysis
- optimization algorithm
- detection algorithm
- evolutionary algorithm
- search space
- objective function
- tree construction
- polynomial size
- similarity measure