Distributed graph coloring : fundamentals and recent developments /

Bibliographic Details
Main Author:	Barenboim, Leonid
Other Authors:	Elkin, Michael (Computer scientist)
Format:	eBook
Language:	English
Published:	San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, [2013]
Series:	Synthesis lectures on distributed computing theory ; #11.
Subjects:	Computer networks > Mathematical models. Electronic data processing > Distributed processing > Mathematical models. Graph coloring. MATHEMATICS / General. arboricity coloring deterministic algorithms distributed symmetry breaking maximal independent set maximal matching randomized algorithms Electronic books.
Online Access:	Connect to the full text of this electronic book

Description
Abstract:	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.
Item Description:	Electronic resource. Part of: Synthesis digital library of engineering and computer science.
Physical Description:	1 online resource (xiii, 157 pages) : illustrations
Bibliography:	Includes bibliographical references (pages 149-155).
ISBN:	1627050191 (electronic bk.) 9781627050197 (electronic bk.)
ISSN:	2155-1634 ;
DOI:	10.2200/S00520ED1V01Y201307DCT011