Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph.

Published in: Comb. Probab. Comput. (1998)

Keyphrases

small number
random walk
data sets
computational complexity
directed graph
undirected graph
image processing
pairwise
semi supervised
connected components
graph matching
weighted graph
finite number