Dynamic and Sensitivity Algorithms for All Shortest Paths
Research output: Book/Report › Report › Research
Standard
Dynamic and Sensitivity Algorithms for All Shortest Paths. / Alstrup, Stephen; Lauridsen, Peter W.
Datalogisk Insitut, Københavns Universitet, 1996. (DIKU Report).Research output: Book/Report › Report › Research
Harvard
Alstrup, S & Lauridsen, PW 1996, Dynamic and Sensitivity Algorithms for All Shortest Paths. DIKU Report, Datalogisk Insitut, Københavns Universitet.
APA
Alstrup, S., & Lauridsen, P. W. (1996). Dynamic and Sensitivity Algorithms for All Shortest Paths. DIKU Report
Vancouver
Alstrup S, Lauridsen PW. Dynamic and Sensitivity Algorithms for All Shortest Paths. Datalogisk Insitut, Københavns Universitet, 1996. (DIKU Report).
Author
Bibtex
@book{c899c31074be11dbbee902004c4f4f50,
title = "Dynamic and Sensitivity Algorithms for All Shortest Paths",
abstract = "DIKU-rapport 96/2",
author = "Stephen Alstrup and Lauridsen, {Peter W.}",
year = "1996",
language = "English",
series = "DIKU Report",
publisher = "DIKU, Univ. of Copenhagen",
}
RIS
TY - RPRT
T1 - Dynamic and Sensitivity Algorithms for All Shortest Paths
AU - Alstrup, Stephen
AU - Lauridsen, Peter W.
PY - 1996
Y1 - 1996
N2 - DIKU-rapport 96/2
AB - DIKU-rapport 96/2
M3 - Report
T3 - DIKU Report
BT - Dynamic and Sensitivity Algorithms for All Shortest Paths
CY - Datalogisk Insitut, Københavns Universitet
ER -
ID: 23233