Local computation algorithms for graphs of non-constant degrees
Name
899983175-MIT.pdf
Description
Full printable version
Size
1.84 MB
Format
Adobe PDF
Checksum (MD5)
4f6a76bac2d7f430923a256c066da8b9
Author(s)
Yodpinyanee, Anak
Advisor(s)
Ronitt Rubinfeld.
Alternative Title
LCAs for graphs of non-constant degrees
Date Issued
2014
Publisher
Massachusetts Institute of Technology
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. 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. Instead, we consider the case where parameter d can be moderately dependent on n, and aim for complexities with quasi-polynomial dependence on d, while maintaining polylogarithmic dependence on n. In this thesis, we give randomized LCAs for computing maximal independent sets, maximal matchings, and approximate maximum matchings. Both time and space complexities of our LCAs on these problems are 2 0(log3 d)polylog(n), 2 0(log2 d)polylog(n) and 2 0(log3 d)polylog(n), respectively.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 41-44).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
