2026-09-20T04:39:57Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/930502022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Ronitt Rubinfeld.
Yodpinyanee, Anak
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2015-01-20T17:57:58Z
2015-01-20T17:57:58Z
2014
2014
http://hdl.handle.net/1721.1/93050
899983175
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).
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.
by Anak Yodpinyanee.
S.M.
44 pages
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Local computation algorithms for graphs of non-constant degrees
LCAs for graphs of non-constant degrees
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="76885db7-053f-4317-bc3e-671c3be12b7b">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Local computation algorithms for graphs of non-constant degrees</Title>
<Subtitle>LCAs for graphs of non-constant degrees</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2014</PublicationDate>
<Authors>
<Author>
<DisplayName>Yodpinyanee, Anak</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>