In this paper we analyze algorithms for the graph colouring problem from a probabilistic point of view. Furthermore we show that the chromatic number of a graph converges to n log 1/q / 2 log n almost surely.

Related Organizations

Sapienza University of Rome
Italy

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average