Experiments on Dense Graphs with a Stochastic, Peer-to-Peer Colorer
Stephen Fitzpatrick, Lambert Meertens · 2002
This paper reports on a simple, stochastic, scalable, peerto-peer algorithm for approximately solving distributed constraint problems in soft real time. The performance of the algorithm is assessed using soft k-coloring of random graphs having known chromatic number and edge probability ranging from moderate to high.