Efficient Graph algorithms and Data Structures

Publikation: Bog/antologi/afhandling/rapport › Ph.d.-afhandling › Forskning

Standard

Efficient Graph algorithms and Data Structures. / Holm, Jacob.

Department of Computer Science, Faculty of Science, University of Copenhagen, 2018.

Publikation: Bog/antologi/afhandling/rapport › Ph.d.-afhandling › Forskning

Harvard

Holm, J 2018, Efficient Graph algorithms and Data Structures. Department of Computer Science, Faculty of Science, University of Copenhagen. <https://soeg.kb.dk/permalink/45KBDK_KGL/fbp0ps/alma99122432453305763>

APA

Holm, J. (2018). Efficient Graph algorithms and Data Structures. Department of Computer Science, Faculty of Science, University of Copenhagen. https://soeg.kb.dk/permalink/45KBDK_KGL/fbp0ps/alma99122432453305763

Vancouver

Holm J. Efficient Graph algorithms and Data Structures. Department of Computer Science, Faculty of Science, University of Copenhagen, 2018.

Author

Holm, Jacob. / Efficient Graph algorithms and Data Structures. Department of Computer Science, Faculty of Science, University of Copenhagen, 2018.

Bibtex

@phdthesis{73026372360642c5aae72f2ef7e6a213,
title = "Efficient Graph algorithms and Data Structures",
abstract = "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.",
author = "Jacob Holm",
year = "2018",
language = "English",
publisher = "Department of Computer Science, Faculty of Science, University of Copenhagen",

}

RIS

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://soeg.kb.dk/permalink/45KBDK_KGL/fbp0ps/alma99122432453305763

M3 - Ph.D. thesis

BT - Efficient Graph algorithms and Data Structures

PB - Department of Computer Science, Faculty of Science, University of Copenhagen

ER -

ID: 213961210