Two bounds of chromatic number in graphs coloring problem.

Assia Gueham Anass Nagih Hacène Aït Haddadène

Published in: CoDIT (2014)

Keyphrases

small number
machine learning
special case
undirected graph
graph representation
data sets
lower bound
random walk
memory requirements
color information
graph theory
maximum number
graph theoretic