There is a long history of research in theoretical computer science devoted to designing efficient algorithms for graph problems. In many modern applications the graph in question is changing over time, and we would like to avoid rerunning our algorithm on the entire graph every time a small change occurs. The evolving nature of graphs motivates the dynamic graph model, in which the goal is to minimize the amount of work needed to reoptimize the solution when the graph changes. There is a large body of literature on dynamic algorithms for basic problems that arise in graphs. This thesis presents several improved dynamic algorithms for two fundamental graph problems: shortest paths, and matching.
| Identifer | oai:union.ndltd.org:columbia.edu/oai:academiccommons.columbia.edu:10.7916/D8QF8T2W |
| Date | January 2016 |
| Creators | Bernstein, Aaron |
| Source Sets | Columbia University |
| Language | English |
| Detected Language | English |
| Type | Theses |
Page generated in 0.0059 seconds