Conditional lower bounds for graph sensitivity problems
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Virginia Vassilevska Williams.
MetadataShow full item record
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.
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, 2019Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 59-60).
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology
Electrical Engineering and Computer Science.