Conditional lower bounds for graph sensitivity problems
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2019
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/1721.1/123000 |
| _version_ | 1826214707215728640 |
|---|---|
| author | Ancona, Bertie(Alberto) |
| author2 | Virginia Vassilevska Williams. |
| author_facet | Virginia Vassilevska Williams. Ancona, Bertie(Alberto) |
| author_sort | Ancona, Bertie(Alberto) |
| collection | MIT |
| description | This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. |
| first_indexed | 2024-09-23T16:10:11Z |
| format | Thesis |
| id | mit-1721.1/123000 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T16:10:11Z |
| publishDate | 2019 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1230002019-11-22T03:02:52Z Conditional lower bounds for graph sensitivity problems Ancona, Bertie(Alberto) Virginia Vassilevska Williams. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Electrical Engineering and Computer Science. 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 2019-11-22T00:01:01Z 2019-11-22T00:01:01Z 2019 2019 Thesis https://hdl.handle.net/1721.1/123000 1127388799 eng 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 60 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Ancona, Bertie(Alberto) Conditional lower bounds for graph sensitivity problems |
| title | Conditional lower bounds for graph sensitivity problems |
| title_full | Conditional lower bounds for graph sensitivity problems |
| title_fullStr | Conditional lower bounds for graph sensitivity problems |
| title_full_unstemmed | Conditional lower bounds for graph sensitivity problems |
| title_short | Conditional lower bounds for graph sensitivity problems |
| title_sort | conditional lower bounds for graph sensitivity problems |
| topic | Electrical Engineering and Computer Science. |
| url | https://hdl.handle.net/1721.1/123000 |
| work_keys_str_mv | AT anconabertiealberto conditionallowerboundsforgraphsensitivityproblems |