An algorithm for coloring some perfect graphs.
Hacène Aït HaddadèneSylvain GravierFrédéric MaffrayPublished in: Discret. Math. (1998)
Keyphrases
- learning algorithm
- dynamic programming
- recognition algorithm
- times faster
- experimental evaluation
- matching algorithm
- improved algorithm
- objective function
- preprocessing
- optimization algorithm
- significant improvement
- particle swarm optimization
- probabilistic model
- detection algorithm
- high accuracy
- computational cost
- cost function
- search algorithm
- k means
- search space
- computational complexity
- graph isomorphism
- adjacency graph
- spanning tree
- similarity measure
- optimal solution
- clustering method
- theoretical analysis
- computationally efficient
- expectation maximization
- multi objective
- simulated annealing
- data sets