Loading...
Distributed graph coloring fundamentals and recent developments /
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 discre...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) :
Morgan & Claypool,
c2013.
|
| Series: | Synthesis digital library of engineering and computer science.
Synthesis lectures on distributed computing theory ; # 11. |
| Subjects: | |
| Online Access: | Abstract with links to full text |
| LEADER | 05338nam a2200757 a 4500 | ||
|---|---|---|---|
| 001 | 201307DCT011 | ||
| 005 | 20160320103534.0 | ||
| 006 | m eo d | ||
| 007 | cr cn |||m|||a | ||
| 008 | 130814s2013 caua foab 000 0 eng d | ||
| 020 | |a 9781627050197 (electronic bk.) | ||
| 020 | |z 9781627050180 (pbk.) | ||
| 024 | 7 | |a 10.2200/S00520ED1V01Y201307DCT011 |2 doi | |
| 035 | |a (CaBNVSL)swl00402645 | ||
| 035 | |a (OCoLC)855857834 | ||
| 040 | |a CaBNVSL |c CaBNVSL |d CaBNVSL | ||
| 050 | 4 | |a QA166.247 |b .B273 2013 | |
| 082 | 0 | 4 | |a 511.56 |2 23 |
| 100 | 1 | |a Barenboim, Leonid. | |
| 245 | 1 | 0 | |a Distributed graph coloring |h [electronic resource] : |b fundamentals and recent developments / |c Leonid Barenboim and Michael Elkin. |
| 260 | |a San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : |b Morgan & Claypool, |c c2013. | ||
| 300 | |a 1 electronic text (xiii, 157 p.) : |b ill., digital file. | ||
| 490 | 1 | |a Synthesis lectures on distributed computing theory, |x 2155-1634 ; |v # 11 | |
| 500 | |a Part of: Synthesis digital library of engineering and computer science. | ||
| 500 | |a Series from website. | ||
| 504 | |a Includes bibliographical references (p. 149-155). | ||
| 505 | 0 | |a 1. Introduction -- | |
| 505 | 8 | |a 10. Introduction to distributed randomized algorithms -- 10.1 Simple algorithms -- 10.2 A faster O([delta])-coloring algorithm -- 10.3 Randomized MIS -- 10.3.1 A high-level description -- 10.3.2 Procedure decide -- 10.4 Randomized maximal matching -- 10.5 Graphs with bounded arboricity -- | |
| 505 | 8 | |a 11. Conclusion and open questions -- 11.1 Problems that can be solved in polylogarithmic time -- 11.2 Problems that can be solved in (sub)linear in [delta] time -- 11.3 Algorithms for restricted graph families -- 11.4 Randomized algorithms -- | |
| 505 | 8 | |a 2. Basics of graph theory -- 2.1 Graphs with large girth and large chromatic number -- 2.2 Planar graphs -- 2.3 Arboricity -- 2.3.1 Nash-Williams theorem -- 2.3.2 Degeneracy and arboricity -- 2.4 Defective coloring -- 2.5 Edge-coloring and matchings -- | |
| 505 | 8 | |a 3. Basic distributed graph coloring algorithms -- 3.1 The distributed message-passing LOCAL model -- 3.2 Basic color reduction -- 3.3 Orientations -- 3.4 The algorithm of Cole and Vishkin -- 3.5 Extensions to graphs with bounded maximum degree -- 3.6 An improved coloring algorithm for graphs with bounded maximum degree -- 3.7 A faster ([delta plus] 1)-coloring -- 3.8 Kuhn-Wattenhofer color reduction technique and its applications -- 3.9 A reduction from ([delta plus] 1)-coloring to MIS -- 3.10 Linial's algorithm -- | |
| 505 | 8 | |a 4. Lower bounds -- 4.1 Coloring unoriented trees -- 4.1.1 The first proof -- 4.1.2 The second proof -- 4.2 Coloring the n-path Pn -- | |
| 505 | 8 | |a 5. Forest-decomposition algorithms and applications -- 5.1 H-partition -- 5.2 An O(a)-coloring -- 5.3 Faster coloring -- 5.4 MIS algorithms -- | |
| 505 | 8 | |a 6. Defective coloring -- 6.1 Employing defective coloring for computing legal coloring -- 6.2 Defective coloring algorithms -- 6.2.1 Procedure refine -- 6.2.2 Procedure defective-color -- | |
| 505 | 8 | |a 7. Arbdefective coloring -- 7.1 Small arboricity decomposition -- 7.2 Efficient coloring algorithms -- | |
| 505 | 8 | |a 8. Edge-coloring and maximal matching -- 8.1 Edge-coloring and maximal matching using forest-decomposition -- 8.2 Edge-coloring using bounded neighborhood independence -- | |
| 505 | 8 | |a 9. Network decompositions -- 9.1 Applications of network decompositions -- 9.2 Ruling sets and forests -- 9.3 Constructing network decompositions -- | |
| 505 | 8 | |a Bibliography -- Authors' biographies. | |
| 506 | |a Abstract freely available; full-text restricted to subscribers or individual document purchasers. | ||
| 510 | 0 | |a Compendex | |
| 510 | 0 | |a Google book search | |
| 510 | 0 | |a Google scholar | |
| 510 | 0 | |a INSPEC | |
| 520 | 3 | |a 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. | |
| 530 | |a Also available in print. | ||
| 538 | |a Mode of access: World Wide Web. | ||
| 538 | |a System requirements: Adobe Acrobat Reader. | ||
| 588 | |a Title from PDF t.p. (viewed on August 14, 2013). | ||
| 650 | 0 | |a Broken symmetry (Physics) | |
| 650 | 0 | |a Electronic data processing |x Distributed processing. | |
| 650 | 0 | |a Graph coloring |x Mathematical models. | |
| 653 | |a arboricity | ||
| 653 | |a coloring | ||
| 653 | |a deterministic algorithms | ||
| 653 | |a distributed symmetry breaking | ||
| 653 | |a maximal independent set | ||
| 653 | |a maximal matching | ||
| 653 | |a randomized algorithms | ||
| 700 | 1 | |a Elkin, Michael. | |
| 776 | 0 | 8 | |i Print version: |z 9781627050180 |
| 830 | 0 | |a Synthesis digital library of engineering and computer science. | |
| 830 | 0 | |a Synthesis lectures on distributed computing theory ; |v # 11. |x 2155-1634 | |
| 856 | 4 | 8 | |3 Abstract with links to full text |u http://dx.doi.org/10.2200/S00520ED1V01Y201307DCT011 |
| 942 | |c EB | ||
| 999 | |c 81072 |d 81072 | ||
| 952 | |0 0 |1 0 |4 0 |7 0 |9 73092 |a MGUL |b MGUL |d 2016-03-20 |l 0 |r 2016-03-20 |w 2016-03-20 |y EB | ||