An Approximate Algorithm for the Chromatic Number of Graphs.
Guillermo De Ita LunaJosé Raymundo Marcial-RomeroYolanda MoyaoPublished in: Electron. Notes Discret. Math. (2014)
Keyphrases
- computational complexity
- learning algorithm
- experimental evaluation
- optimization algorithm
- dynamic programming
- computational effort
- memory requirements
- times faster
- cost function
- single scan
- search space
- similarity measure
- random graphs
- matching algorithm
- undirected graph
- expectation maximization
- objective function
- graph isomorphism
- recognition algorithm
- detection algorithm
- segmentation algorithm
- high accuracy
- computational cost
- np hard
- semi supervised
- graph partitioning
- graph clustering
- neural network
- significant improvement
- k means
- optimal solution
- image processing
- genetic algorithm