An Approximate Algorithm for the Chromatic Number of a Graph.
Guillermo De Ita LunaFernando Zacarías FloresJosé Raymundo Marcial-RomeroPublished in: CTW (2012)
Keyphrases
- computational complexity
- memory requirements
- k means
- learning algorithm
- simulated annealing
- random graphs
- worst case
- probabilistic model
- np hard
- space complexity
- detection algorithm
- minimum spanning tree
- preprocessing
- objective function
- polynomial time complexity
- matching algorithm
- times faster
- optimization algorithm
- search space
- shortest path problem
- expectation maximization
- dynamic programming
- similarity measure
- np complete
- graph theory
- particle swarm optimization
- computational cost
- cost function
- graph construction
- graph based algorithm