Conditional lower bounds for graph sensitivity problems
Name
1127388799-MIT.pdf
Size
958.12 KB
Format
Adobe PDF
Checksum (MD5)
cdc664b1085a90be746fe526c1dca196
Author(s)
Ancona, Bertie(Alberto)
Advisor(s)
Virginia Vassilevska Williams.
Date Issued
2019
Publisher
Massachusetts Institute of Technology
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.
Description
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).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
