Efficient Graph algorithms and Data Structures
Research output: Book/Report › Ph.D. thesis › Research
The graph is one of the most important abstractions used in computer science. This thesis gives substantial improvements to the state of the art regarding 4 different problems on static or dynamic graphs, namely: Static reachability in planar graphs, Online bipartite matching with recourse, Deterministic fully-dynamic 2-edge connectivity and bridge-finding, and Strong trail orientations of graphs.
Original language | English |
---|
Publisher | Department of Computer Science, Faculty of Science, University of Copenhagen |
---|---|
Publication status | Published - 2018 |
ID: 213961210