2026-09-19T19:54:46Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1515202023-08-01T04:00:50Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Rubinfeld, Ronitt
Singhal, Mihir
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2023-07-31T19:45:57Z
2023-07-31T19:45:57Z
2023-06
2023-06-06T16:35:01.099Z
https://hdl.handle.net/1721.1/151520
We consider the question of orienting the edges in a graph ๐บ such that every vertex has bounded out-degree. For graphs of arboricity ๐ผ, there is an orientation in which every vertex has out-degree at most ๐ผ, and moreover, this is the best possible. We are thus interested in algorithms that can achieve a maximum out-degree of close to ๐ผ. A widely studied approach for this problem in the distributed algorithms setting is a โpeeling algorithmโ that provides an orientation with maximum out-degree ๐ผ(2 + ๐) in a logarithmic number of iterations.
We consider this problem in the local computation algorithm (LCA) model, which quickly answers queries of the form โWhat is the orientation of edge (๐ข, ๐ฃ)?โ by probing the input graph. When the peeling algorithm is executed in the LCA setting by applying standard techniques, e.g., the Parnas-Ron paradigm, it requires ฮฉ(๐) probes per query on an ๐-vertex graph. In the case where ๐บ has unbounded degree, we show that any LCA which orients its edges to yield maximum out-degree ๐ must use ฮฉ( โ ๐/๐) probes to ๐บ per query in the worst case, even if ๐บ is known to be a forest (that is, ๐ผ = 1). We also show several algorithms with sublinear probe complexity when ๐บ has unbounded degree. When the maximum degree ฮ of ๐บ is bounded, we demonstrate an algorithm that uses [formulation] probes to ๐บ per query. To obtain this result, we develop an edge-coloring approach that ultimately yields a graph shattering-like result. We also use this shattering-like result to demonstrate an LCA which can 4-color any tree using sublinear probes per query.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright retained by author(s)
https://rightsstatements.org/page/InC-EDU/1.0/
Locally computing edge orientations
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="519a27e3-d464-4b12-93ed-ee15dc95ea11">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Locally computing edge orientations</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2023-06</PublicationDate>
<Authors>
<Author>
<DisplayName>Singhal, Mihir</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>https://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>We consider the question of orienting the edges in a graph ๐บ such that every vertex has bounded out-degree. For graphs of arboricity ๐ผ, there is an orientation in which every vertex has out-degree at most ๐ผ, and moreover, this is the best possible. We are thus interested in algorithms that can achieve a maximum out-degree of close to ๐ผ. A widely studied approach for this problem in the distributed algorithms setting is a โpeeling algorithmโ that provides an orientation with maximum out-degree ๐ผ(2 + ๐) in a logarithmic number of iterations.
We consider this problem in the local computation algorithm (LCA) model, which quickly answers queries of the form โWhat is the orientation of edge (๐ข, ๐ฃ)?โ by probing the input graph. When the peeling algorithm is executed in the LCA setting by applying standard techniques, e.g., the Parnas-Ron paradigm, it requires ฮฉ(๐) probes per query on an ๐-vertex graph. In the case where ๐บ has unbounded degree, we show that any LCA which orients its edges to yield maximum out-degree ๐ must use ฮฉ( โ ๐/๐) probes to ๐บ per query in the worst case, even if ๐บ is known to be a forest (that is, ๐ผ = 1). We also show several algorithms with sublinear probe complexity when ๐บ has unbounded degree. When the maximum degree ฮ of ๐บ is bounded, we demonstrate an algorithm that uses [formulation] probes to ๐บ per query. To obtain this result, we develop an edge-coloring approach that ultimately yields a graph shattering-like result. We also use this shattering-like result to demonstrate an LCA which can 4-color any tree using sublinear probes per query.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>