000			04624nam a22004095i 4500
999			_c387871 _d387871
001			387871
003			ES-MaUEC
005			20230427084949.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			230427s2013 sz | s |||| 0|eng d
020			_a9783031020094
024	7		_a10.1007/978-3-031-02009-4 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA166.247 _b2013 EB
100	1		_aBarenboim, Leonid _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9688270
245	1	0	_aDistributed Graph Coloring : _bFundamentals and Recent Developments _cby Leonid Barenboim, Michael Elkin
250			_a1st edition 2013
264		1	_aCham _bSpringer International Publishing _c2013
300			_a1 recurso en línea (XIII, 157 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Distributed Computing Theory _x2155-1634
505	0		_aAcknowledgments -- Introduction -- Basics of Graph Theory -- Basic Distributed Graph Coloring Algorithns -- Lower Bounds -- Forest-Decomposition Algorithms and Applications -- Defective Coloring -- Arbdefective Coloring -- Edge-Coloring and Maximal Matching -- Network Decompositions -- Introduction to Distributed Randomized Algorithms -- Conclusion and Open Questions -- Bibliography -- Authors' Biographies.
520			_aThe 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.
988			_aSynthesis Collection of Technology_2013
650		7	_2embne _9146336 _aGrafos, Teoría de
700	1		_aElkin, Michael _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9688271 _c(Computer scientist)
776	0	8	_iPrinted edition: _z9783031008818
776	0	8	_iPrinted edition: _z9783031031373
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02009-4 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b04/2023 _dz _eIG _zSI