Vidal's library
Title: An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs
Author: Stephen Fitzpatrick and Lambert Meertens
Book Tittle: First Symposium on Stochastic Algorithms: Foundations and Applications
Editor: Kathleen Steinhoefel
Pages: 49--64
Publisher: Springer-Verlag
Year: 2001
Abstract: 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.

Cited by 20  -  Google Scholar

@InCollection{fitzpatrick01a,
  author =	 {Stephen Fitzpatrick and Lambert Meertens},
  title =	 {An Experimental Assessment of a Stochastic, Anytime,
                  Decentralized, Soft Colourer for Sparse Graphs},
  googleid =	 {s9q9mULYOfoJ:scholar.google.com/},
  booktitle =	 {First Symposium on Stochastic Algorithms:
                  Foundations and Applications},
  pages =	 {49--64},
  publisher =	 {Springer-Verlag},
  year =	 2001,
  editor =	 {Kathleen Steinhoefel},
  note =	 {LNCS 2264},
  abstract =	 {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.},
  keywords =     {distributed-search dcsp},
  url =
                  {http://jmvidal.cse.sc.edu/library/fitzpatrick01a.pdf},
  cluster = 	 {18030680363713288883}
}
Last modified: Wed Mar 9 10:15:09 EST 2011