A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
Shuji IsobeXiao ZhouTakao NishizekiPublished in: Int. J. Found. Comput. Sci. (1999)
Keyphrases
- tree structure
- computational complexity
- worst case
- learning algorithm
- high accuracy
- k means
- dynamic programming
- search space
- np hard
- experimental evaluation
- objective function
- theoretical analysis
- optimization algorithm
- times faster
- matching algorithm
- linear programming
- recognition algorithm
- binary tree
- strongly polynomial
- simulated annealing
- computational cost
- special case
- preprocessing
- similarity measure