Minimum Coloring k-Colorable Graphs in Polynomial Average Time.
C. R. SubramanianPublished in: J. Algorithms (1999)
Keyphrases
- spanning tree
- graph matching
- graph theory
- multiagent evolutionary algorithm
- graph clustering
- standard deviation
- graph representation
- graph mining
- minimum cost
- series parallel
- graph data
- graph theoretic
- undirected graph
- weighted graph
- data sets
- upper bound
- object recognition
- bayesian networks
- knowledge base
- structured objects
- connected dominating set
- data mining