Changes between Version 1 and Version 2 of DLF


Ignore:
Timestamp:
Feb 14, 2005 4:07:59 PM (15 years ago)
Author:
hauma
Comment:

Typo

Legend:

Unmodified
Added
Removed
Modified
  • DLF

    v1 v2  
    33The algorithm in ![1] colors a distributed graph, but requires synchronized rounds. The following extension formulated as message passing algorithm removes the explicit synchronization requirement.
    44
    5 The wiki:IncrementalDLF algorithm extends this version by allowing changes to the colored graph and fixing the coloring incrementally.
     5The wiki:IncDLF algorithm extends this version by allowing changes to the colored graph and fixing the coloring incrementally.
    66
    77![1] Distributed Largest-First Algorithm for Graph Coloring, Jennie Hansen, Marek Kubale, Łukasz Kuszner, and Adam Nadolski. In Proceedings of the 10th International Euro-Par Conference of Lecture Notes in Computer Science Volume 3149, pages 804-811, Pisa, Italy, August 31 - September 3, 2004, Springer Verlag, Heidelberg, Germany, 2004