A unified algorithm for colouring graphs of bounded clique-width.
Bruno CourcelleIrène DurandMichael RaskinPublished in: CoRR (2020)
Keyphrases
- computational complexity
- learning algorithm
- times faster
- preprocessing
- graph construction
- optimization algorithm
- experimental evaluation
- np hard
- cost function
- k means
- search space
- particle swarm optimization
- optimal solution
- matching algorithm
- genetic algorithm
- computational cost
- probabilistic model
- simulated annealing
- clustering method
- objective function
- minimum spanning tree