Coloring graphs from lists with bounded size of their union.

Daniel Král Jirí Sgall

Published in: J. Graph Theory (2005)

Keyphrases

bounded treewidth
bounded degree
graph matching
small size
maximal cliques
real time
computational complexity
directed graph
data sets
data mining
graphical models
graph theoretic
maximum clique
uniform random