Faster Algorithms for the Dynamic Single-Source Shortest Paths Problem in Sparse Digraphs
dc.contributor.author
Meierhans, Simon
dc.contributor.supervisor
Probst Gutenberg, Maximilian
dc.contributor.supervisor
Kyng, Rasmus
dc.date.accessioned
2021-09-01T12:43:41Z
dc.date.available
2021-09-01T08:50:18Z
dc.date.available
2021-09-01T12:43:41Z
dc.date.issued
2021
dc.identifier.uri
http://hdl.handle.net/20.500.11850/503419
dc.format
application/pdf
en_US
dc.language.iso
en
en_US
dc.publisher
ETH Zurich
en_US
dc.title
Faster Algorithms for the Dynamic Single-Source Shortest Paths Problem in Sparse Digraphs
en_US
dc.type
Master Thesis
ethz.size
61 p.
en_US
ethz.publication.place
Zurich
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::09687 - Kyng, Rasmus / Kyng, Rasmus
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::09687 - Kyng, Rasmus / Kyng, Rasmus
en_US
ethz.date.deposited
2021-09-01T08:50:24Z
ethz.source
FORM
ethz.eth
yes
en_US
ethz.availability
Closed access
en_US
ethz.date.embargoend
9999-12-31
ethz.rosetta.installDate
2021-09-01T12:43:50Z
ethz.rosetta.lastUpdated
2022-03-29T11:25:54Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Faster%20Algorithms%20for%20the%20Dynamic%20Single-Source%20Shortest%20Paths%20Problem%20in%20Sparse%20Digraphs&rft.date=2021&rft.au=Meierhans,%20Simon&rft.genre=unknown&rft.btitle=Faster%20Algorithms%20for%20the%20Dynamic%20Single-Source%20Shortest%20Paths%20Problem%20in%20Sparse%20Digraphs
Files in this item
Publication type
-
Master Thesis [1875]