2026-09-20T08:31:34Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1230002026-06-06T00:56:08Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Virginia Vassilevska Williams.
Ancona, Bertie(Alberto)
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2019-11-22T00:01:01Z
2019-11-22T00:01:01Z
2019
2019
https://hdl.handle.net/1721.1/123000
1127388799
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 59-60).
In this thesis, we show conditional lower bounds for graph distance problems in the sensitivity setting, a restriction on the dynamic setting. We consider graph diameter, radius, and eccentricities over a few distance metrics, and sensitivities both constant and logarithmic in the size of the graph. Despite these restrictions, we find that many lower bound results from the static and fully dynamic settings still hold under popular conjectures. We show many of these lower bounds for graphs with constant maximum degree as well.
by Bertie Ancona.
M.Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
60 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Conditional lower bounds for graph sensitivity problems
Thesis
application/pdf
2019-11-22T00:01:00Z
Publication
Master
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="e3d174a2-1aa4-4dcf-8d3a-16564028f4c5">
<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>Conditional lower bounds for graph sensitivity problems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2019</PublicationDate>
<Authors>
<Author>
<DisplayName>Ancona, Bertie(Alberto)</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 this thesis, we show conditional lower bounds for graph distance problems in the sensitivity setting, a restriction on the dynamic setting. We consider graph diameter, radius, and eccentricities over a few distance metrics, and sensitivities both constant and logarithmic in the size of the graph. Despite these restrictions, we find that many lower bound results from the static and fully dynamic settings still hold under popular conjectures. We show many of these lower bounds for graphs with constant maximum degree as well.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>