Page 1 MORGAN & CLAYPOOL PUBLISHERS Distributed Graph Coloring Fundamentals and
Recent Developments Leonid Barenboim Michael Elkin HESIS SYNTHESIS LECTURES ON …

A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

By integrating wireless, video, speech and real-time data access technologies, a unique
shop** assistant service can be created that personalizes the attention provided to a …

We study the verification problem in distributed networks, stated as follows. Let H be a
subgraph of a network G where each vertex of G knows which edges incident on it are in H …

Symmetry-breaking problems are among the most well studied in the field of distributed
computing and yet the most fundamental questions about their complexity remain open. In …

Abstract The Maximal Independent Set (MIS) problem is one of the basics in the study of
locality in distributed graph algorithms. This paper presents a very simple randomized …

Over the past 30 years numerous algorithms have been designed for symmetry breaking
problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge …

There are distributed graph algorithms for finding maximal matchings and maximal
independent sets in O (Δ+ log* n) communication rounds; here, n is the number of nodes …

Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring,
maximal matching, maximal independent set, etc., is a long-standing challenge in distributed …