TY - BOOK
T1 - Efficient Graph algorithms and Data Structures
AU - Holm, Jacob
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
UR - https://rex.kb.dk/primo-explore/fulldisplay?docid=KGL01012001632&context=L&vid=NUI&search_scope=KGL&tab=default_tab&lang=da_DK
M3 - Ph.D. thesis
BT - Efficient Graph algorithms and Data Structures
PB - Department of Computer Science, Faculty of Science, University of Copenhagen
ER -