Distributed Graph Coloring

Distributed Graph Coloring
Author :
Publisher : Springer Nature
Total Pages : 161
Release :
ISBN-10 : 9783031020094
ISBN-13 : 303102009X
Rating : 4/5 (09X Downloads)

Book Synopsis Distributed Graph Coloring by : Leonid Barenboim

Download or read book Distributed Graph Coloring written by Leonid Barenboim and published by Springer Nature. This book was released on 2022-06-01 with total page 161 pages. Available in PDF, EPUB and Kindle. Book excerpt: The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E), whose vertices host autonomous processors. The processors communicate over the edges of G in discrete rounds. The goal is to devise algorithms that use as few rounds as possible. A typical symmetry-breaking problem is the problem of graph coloring. Denote by ? the maximum degree of G. While coloring G with ? + 1 colors is trivial in the centralized setting, the problem becomes much more challenging in the distributed one. One can also compromise on the number of colors, if this allows for more efficient algorithms. Other typical symmetry-breaking problems are the problems of computing a maximal independent set (MIS) and a maximal matching (MM). The study of these problems dates back to the very early days of distributed computing. The founding fathers of distributed computing laid firm foundations for the area of distributed symmetry breaking already in the eighties. In particular, they showed that all these problems can be solved in randomized logarithmic time. Also, Linial showed that an O(?2)-coloring can be solved very efficiently deterministically. However, fundamental questions were left open for decades. In particular, it is not known if the MIS or the (? + 1)-coloring can be solved in deterministic polylogarithmic time. Moreover, until recently it was not known if in deterministic polylogarithmic time one can color a graph with significantly fewer than ?2 colors. Additionally, it was open (and still open to some extent) if one can have sublogarithmic randomized algorithms for the symmetry breaking problems. Recently, significant progress was achieved in the study of these questions. More efficient deterministic and randomized (? + 1)-coloring algorithms were achieved. Deterministic ?1 + o(1)-coloring algorithms with polylogarithmic running time were devised. Improved (and often sublogarithmic-time) randomized algorithms were devised. Drastically improved lower bounds were given. Wide families of graphs in which these problems are solvable much faster than on general graphs were identified. The objective of our monograph is to cover most of these developments, and as a result to provide a treatise on theoretical foundations of distributed symmetry breaking in the message-passing model. We hope that our monograph will stimulate further progress in this exciting area.


Distributed Graph Coloring Related Books

Distributed Graph Coloring
Language: en
Pages: 161
Authors: Leonid Barenboim
Categories: Computers
Type: BOOK - Published: 2022-06-01 - Publisher: Springer Nature

GET EBOOK

The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is rep
Distributed Graph Algorithms for Computer Networks
Language: en
Pages: 328
Authors: Kayhan Erciyes
Categories: Computers
Type: BOOK - Published: 2013-05-16 - Publisher: Springer Science & Business Media

GET EBOOK

This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical impleme
The Boost Graph Library
Language: en
Pages: 465
Authors: Jeremy G. Siek
Categories: Computers
Type: BOOK - Published: 2001-12-20 - Publisher: Pearson Education

GET EBOOK

The Boost Graph Library (BGL) is the first C++ library to apply the principles of generic programming to the construction of the advanced data structures and al
Distributed Computing
Language: en
Pages: 359
Authors: David Peleg
Categories: Computers
Type: BOOK - Published: 2000-01-01 - Publisher: SIAM

GET EBOOK

Presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce
Graph Coloring Problems
Language: en
Pages: 320
Authors: Tommy R. Jensen
Categories: Mathematics
Type: BOOK - Published: 2011-10-24 - Publisher: John Wiley & Sons

GET EBOOK

Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved prob