Brief announcement: Local computation algorithms for graphs of non-constant degrees

Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee

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

11 Scopus citations

Abstract

In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. This key aspect of LCAs generalizes various other models such as parallel algorithms, local filters and reconstructors. For graph problems, design techniques for LCAs and distributed algorithms are closely related and have been proven useful in each other's context. Many recently developed LCAs on graph problems achieve time and space complexities with very low dependence on n, the number of vertices. Nonetheless, these complexities are generally at least exponential in d, the upper bound on the degree of the input graph. We consider the case where the parameter d can be moderately dependent on n, and aim for complexities with subexponential dependence on d, while maintaining polylogarithmic dependence on n. We present: • a randomized LCA for computing maximal independent sets whose time and space complexities are quasipolynomial in d and polylogarithmic in n; • for constant ∈ > 0, a randomized LCA that provides a (1 - ∈)-approximation to maximum matching with high probability, whose time and space complexities are polynomial in d and polylogarithmic in n.

Original languageEnglish
Title of host publicationSPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages59-61
Number of pages3
ISBN (Electronic)9781450335881
DOIs
StatePublished - 13 Jun 2015
Event27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015 - Portland, United States
Duration: 13 Jun 201515 Jun 2015

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures
Volume2015-June

Conference

Conference27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015
Country/TerritoryUnited States
CityPortland
Period13/06/1515/06/15

Funding

FundersFunder number
Israel Science Foundation
National Science Foundation
Directorate for Computer and Information Science and Engineering1217423, 1420692, 1065125

    Keywords

    • Local computation algorithms
    • Maximal independent set
    • Maximum matching

    Fingerprint

    Dive into the research topics of 'Brief announcement: Local computation algorithms for graphs of non-constant degrees'. Together they form a unique fingerprint.

    Cite this