Login / Signup
Another bound on the chromatic number of a graph.
Paul A. Catlin
Published in:
Discret. Math. (1978)
Keyphrases
</>
small number
random walk
directed graph
data sets
database
bayesian networks
computational complexity
approximation algorithms
connected graphs
constant factor
fixed number
finite number
graph theory
shortest path
np complete
worst case
upper bound
special case
data structure
machine learning