Distributed graph coloring fundamentals and recent developments /

other_versions_link

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...

Full description

Bibliographic Details
Main Author: Barenboim, Leonid
Other Authors: Elkin, Michael
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:
Broken symmetry (Physics)
Electronic data processing > Distributed processing.
Graph coloring > Mathematical models.
arboricity
coloring
deterministic algorithms
distributed symmetry breaking
maximal independent set
maximal matching
randomized algorithms
Online Access:Abstract with links to full text
Description
Summary: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:Part of: Synthesis digital library of engineering and computer science.
Series from website.
Physical Description:1 electronic text (xiii, 157 p.) : ill., digital file.
Also available in print.
Format:Mode of access: World Wide Web.
System requirements: Adobe Acrobat Reader.
Bibliography:Includes bibliographical references (p. 149-155).
ISBN:9781627050197 (electronic bk.)
ISSN:2155-1634 ;
Access:Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Similar Items