An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs [chapter]

Stephen Fitzpatrick, Lambert Meertens
2001 Lecture Notes in Computer Science  
This paper reports on a simple, decentralized, anytime, stochastic, soft graph-colouring algorithm. The algorithm is designed to quickly reduce the number of colour conflicts in large, sparse graphs in a scalable, robust, low-cost manner. The algorithm is experimentally evaluated in a framework motivated by its application to resource coordination in large, distributed networks.
doi:10.1007/3-540-45322-9_3 fatcat:7lg5somafnbe5ngces2ndnwmja