Standard
Fast and compact oracles for approximate distances in planar graphs. / Muller, Laurent Flindt; Zachariasen, Martin.
Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings. red. / Lars Arge; Michael Hoffmann; Emo Welzl. Berlin/Heidelberg : Springer, 2007. s. 657–668 (Lecture notes in computer science; Nr. 4698).
Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning
Harvard
Muller, LF & Zachariasen, M 2007,
Fast and compact oracles for approximate distances in planar graphs. i L Arge, M Hoffmann & E Welzl (red),
Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings. Springer, Berlin/Heidelberg, Lecture notes in computer science, nr. 4698, s. 657–668.
https://doi.org/10.1007/978-3-540-75520-3_58APA
Muller, L. F., & Zachariasen, M. (2007).
Fast and compact oracles for approximate distances in planar graphs. I L. Arge, M. Hoffmann, & E. Welzl (red.),
Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings (s. 657–668). Springer. Lecture notes in computer science Nr. 4698
https://doi.org/10.1007/978-3-540-75520-3_58Vancouver
Muller LF, Zachariasen M.
Fast and compact oracles for approximate distances in planar graphs. I Arge L, Hoffmann M, Welzl E, red., Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings. Berlin/Heidelberg: Springer. 2007. s. 657–668. (Lecture notes in computer science; Nr. 4698).
https://doi.org/10.1007/978-3-540-75520-3_58Author
Muller, Laurent Flindt ; Zachariasen, Martin. / Fast and compact oracles for approximate distances in planar graphs. Algorithms - ESA 2007: 15th Annual European Symposium on Algorithms, Eilat, Israel, October 8-10, 2007. Proceedings. red. / Lars Arge ; Michael Hoffmann ; Emo Welzl. Berlin/Heidelberg : Springer, 2007. s. 657–668 (Lecture notes in computer science; Nr. 4698).
Bibtex
@inbook{47732000f26811dcbee902004c4f4f50,
title = "Fast and compact oracles for approximate distances in planar graphs",
keywords = "Faculty of Science, korteste veje, datastrukturer, shortest paths, data structures",
author = "Muller, {Laurent Flindt} and Martin Zachariasen",
year = "2007",
doi = "10.1007/978-3-540-75520-3_58",
language = "English",
isbn = "9783540755197",
series = "Lecture notes in computer science",
publisher = "Springer",
number = "4698",
pages = "657–668",
editor = "Lars Arge and Michael Hoffmann and Emo Welzl",
booktitle = "Algorithms - ESA 2007",
address = "Switzerland",
}
RIS
TY - CHAP
T1 - Fast and compact oracles for approximate distances in planar graphs
AU - Muller, Laurent Flindt
AU - Zachariasen, Martin
PY - 2007
Y1 - 2007
KW - Faculty of Science
KW - korteste veje
KW - datastrukturer
KW - shortest paths
KW - data structures
U2 - 10.1007/978-3-540-75520-3_58
DO - 10.1007/978-3-540-75520-3_58
M3 - Book chapter
SN - 9783540755197
T3 - Lecture notes in computer science
SP - 657
EP - 668
BT - Algorithms - ESA 2007
A2 - Arge, Lars
A2 - Hoffmann, Michael
A2 - Welzl, Emo
PB - Springer
CY - Berlin/Heidelberg
ER -
