An algorithm to approximate the chromatic number of graphs.
Angélica Guzmán PonceJosé Raymundo Marcial-RomeroJosé Antonio Hernández ServínGuillermo De Ita LunaPublished in: CONIELECOMP (2015)
Keyphrases
- computational complexity
- computational cost
- computational effort
- significant improvement
- polynomial time complexity
- objective function
- learning algorithm
- np hard
- high accuracy
- memory requirements
- search space
- experimental evaluation
- preprocessing
- undirected graph
- optimal solution
- detection algorithm
- tree structure
- neural network
- single scan
- random graphs
- graph structure
- times faster
- matching algorithm
- optimization algorithm
- worst case
- dynamic programming
- cost function
- clustering method
- convergence rate
- simulated annealing
- space complexity
- piecewise linear
- graph isomorphism
- lower bound