Standard
Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time. / Mozes, Shay; Wulff-Nilsen, Christian.
Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. ed. / Mark de Berg; Ulrich Meyer. Vol. Part II Springer, 2010. p. 206-217.
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Mozes, S
& Wulff-Nilsen, C 2010,
Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time. in M de Berg & U Meyer (eds),
Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. vol. Part II, Springer, pp. 206-217, 18th Annual European Symposium on Algorithms, Liverpool, United Kingdom,
06/09/2010.
https://doi.org/10.1007/978-3-642-15781-3_18APA
Mozes, S.
, & Wulff-Nilsen, C. (2010).
Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time. In M. de Berg, & U. Meyer (Eds.),
Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II (Vol. Part II, pp. 206-217). Springer.
https://doi.org/10.1007/978-3-642-15781-3_18Vancouver
Mozes S
, Wulff-Nilsen C.
Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time. In de Berg M, Meyer U, editors, Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. Vol. Part II. Springer. 2010. p. 206-217
https://doi.org/10.1007/978-3-642-15781-3_18Author
Mozes, Shay ; Wulff-Nilsen, Christian. / Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time. Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. editor / Mark de Berg ; Ulrich Meyer. Vol. Part II Springer, 2010. pp. 206-217
Bibtex
@inproceedings{37e390e023ce11df8ed1000ea68e967b,
title = "Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time",
abstract = "Given an n-vertex planar directed graph with real edge lengths and with no negativecycles, we show how to compute single-source shortest path distances in the graph inO(n log2 n/ log log n) time with O(n) space. This is an improvement of a recent time boundof O(n log2 n) by Klein et al.",
author = "Shay Mozes and Christian Wulff-Nilsen",
year = "2010",
doi = "10.1007/978-3-642-15781-3_18",
language = "English",
isbn = "978-3-642-15780-6",
volume = "Part II",
pages = "206--217",
editor = "{de Berg}, Mark and Ulrich Meyer",
booktitle = "Algorithms – ESA 2010",
publisher = "Springer",
address = "Switzerland",
note = "null ; Conference date: 06-09-2010 Through 08-09-2010",
}
RIS
TY - GEN
T1 - Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time
AU - Mozes, Shay
AU - Wulff-Nilsen, Christian
N1 - Conference code: 18
PY - 2010
Y1 - 2010
N2 - Given an n-vertex planar directed graph with real edge lengths and with no negativecycles, we show how to compute single-source shortest path distances in the graph inO(n log2 n/ log log n) time with O(n) space. This is an improvement of a recent time boundof O(n log2 n) by Klein et al.
AB - Given an n-vertex planar directed graph with real edge lengths and with no negativecycles, we show how to compute single-source shortest path distances in the graph inO(n log2 n/ log log n) time with O(n) space. This is an improvement of a recent time boundof O(n log2 n) by Klein et al.
U2 - 10.1007/978-3-642-15781-3_18
DO - 10.1007/978-3-642-15781-3_18
M3 - Article in proceedings
SN - 978-3-642-15780-6
VL - Part II
SP - 206
EP - 217
BT - Algorithms – ESA 2010
A2 - de Berg, Mark
A2 - Meyer, Ulrich
PB - Springer
Y2 - 6 September 2010 through 8 September 2010
ER -
