An Algorithm for Determining the Chromatic Number of a Graph.
Derek G. CorneilBruce GrahamPublished in: SIAM J. Comput. (1973)
Keyphrases
- computational complexity
- preprocessing
- memory requirements
- learning algorithm
- graph structure
- space complexity
- np hard
- dynamic programming
- minimum spanning tree
- matching algorithm
- connected components
- graph based algorithm
- graph search
- tree structure
- search space
- optimization algorithm
- cost function
- detection algorithm
- depth first search
- spanning tree
- graph model
- particle swarm optimization
- convergence rate
- segmentation algorithm
- recognition algorithm
- directed graph
- undirected graph
- k means
- random graphs
- neural network
- clustering method
- constant factor
- search algorithm
- single scan