Standard
More compact oracles for approximate distances in undirected planar graphs. / Kawarabayashi, Ken-ichi; Sommer, Christian; Thorup, Mikkel.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Sanjeev Khanna. Association for Computing Machinery, 2013. p. 550-563.
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Kawarabayashi, K, Sommer, C
& Thorup, M 2013,
More compact oracles for approximate distances in undirected planar graphs. in S Khanna (ed.),
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, pp. 550-563, Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States,
06/01/2013.
https://doi.org/10.1137/1.9781611973105.40APA
Kawarabayashi, K., Sommer, C.
, & Thorup, M. (2013).
More compact oracles for approximate distances in undirected planar graphs. In S. Khanna (Ed.),
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 550-563). Association for Computing Machinery.
https://doi.org/10.1137/1.9781611973105.40Vancouver
Kawarabayashi K, Sommer C
, Thorup M.
More compact oracles for approximate distances in undirected planar graphs. In Khanna S, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery. 2013. p. 550-563
https://doi.org/10.1137/1.9781611973105.40Author
Kawarabayashi, Ken-ichi ; Sommer, Christian ; Thorup, Mikkel. / More compact oracles for approximate distances in undirected planar graphs. Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Sanjeev Khanna. Association for Computing Machinery, 2013. pp. 550-563
Bibtex
@inproceedings{09b1cdd299c346478d25abc613125d17,
title = "More compact oracles for approximate distances in undirected planar graphs",
author = "Ken-ichi Kawarabayashi and Christian Sommer and Mikkel Thorup",
year = "2013",
doi = "10.1137/1.9781611973105.40",
language = "English",
isbn = "978-1-61197-251-1",
pages = "550--563",
editor = "Sanjeev Khanna",
booktitle = "Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
note = "null ; Conference date: 06-01-2013 Through 08-01-2013",
}
RIS
TY - GEN
T1 - More compact oracles for approximate distances in undirected planar graphs
AU - Kawarabayashi, Ken-ichi
AU - Sommer, Christian
AU - Thorup, Mikkel
N1 - Conference code: 24
PY - 2013
Y1 - 2013
U2 - 10.1137/1.9781611973105.40
DO - 10.1137/1.9781611973105.40
M3 - Article in proceedings
SN - 978-1-61197-251-1
SP - 550
EP - 563
BT - Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
A2 - Khanna, Sanjeev
PB - Association for Computing Machinery
Y2 - 6 January 2013 through 8 January 2013
ER -
