DISTRIBUTIVE GRAPH ALGORITHMS-GLOBAL SOLUTIONS FROM LOCAL DATA.

Nathan Linial*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

133 Scopus citations

Abstract

Processors that reside in the vertices of a graph G and communicate only with their neighbors are considered. The system is synchronous and reliable, there is not limit on message lengths, and local computation is instantaneous. It is shown that a maximal independent set in an n-cycle cannot be found faster than OMEGA (log***n), and this is optimal. The d-regular tree of radius r cannot be colored with fewer than ROOT d colors in time 2r/3. If DELTA is the largest degree in G which has order n, then in time O(log*n) it can be colored with O( DELTA **2) colors.

Original languageAmerican English
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages331-335
Number of pages5
ISBN (Print)0818608072, 9780818608070
DOIs
StatePublished - 1987

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Fingerprint

Dive into the research topics of 'DISTRIBUTIVE GRAPH ALGORITHMS-GLOBAL SOLUTIONS FROM LOCAL DATA.'. Together they form a unique fingerprint.

Cite this