A Linear Algorithm for Finding Total Colorings of Partial k-Trees.
Shuji IsobeXiao ZhouTakao NishizekiPublished in: ISAAC (1999)
Keyphrases
- linear complexity
- experimental evaluation
- times faster
- computational cost
- detection algorithm
- preprocessing
- learning algorithm
- tree structure
- dynamic programming
- k means
- objective function
- significant improvement
- improved algorithm
- matching algorithm
- optimal solution
- optimization algorithm
- theoretical analysis
- cost function
- expectation maximization
- high accuracy
- worst case
- decision trees
- computationally efficient
- segmentation algorithm
- particle swarm optimization
- simulated annealing
- linear systems
- neural network