Finding Patterns, Short Cycles and Long Shortest Paths in Graphs
This thesis is about finding useful structures in a graph using fast algorithms, or showing that no such fast algorithms exist using popular fine-grained hypotheses from the field of Fine-Grained Complexity. These structures can be any small fixed-sized pattern, or more specific bigger structures su...
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Abschlussarbeit |
| Veröffentlicht: |
Massachusetts Institute of Technology
2022
|
| Online Zugang: | https://hdl.handle.net/1721.1/144923 |