Standard
Fast and Compact Exact Distance Oracle for Planar Grap. / Cohen-Addad, Vincent Pierre; Dahlgaard, Søren; Wulff-Nilsen, Christian.
2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, 2017. s. 962-973.
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Cohen-Addad, VP, Dahlgaard, S
& Wulff-Nilsen, C 2017,
Fast and Compact Exact Distance Oracle for Planar Grap. i
2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, s. 962-973, 58th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, California, USA,
15/10/2017.
https://doi.org/10.1109/FOCS.2017.93APA
Cohen-Addad, V. P., Dahlgaard, S.
, & Wulff-Nilsen, C. (2017).
Fast and Compact Exact Distance Oracle for Planar Grap. I
2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS) (s. 962-973). IEEE.
https://doi.org/10.1109/FOCS.2017.93Vancouver
Cohen-Addad VP, Dahlgaard S
, Wulff-Nilsen C.
Fast and Compact Exact Distance Oracle for Planar Grap. I 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE. 2017. s. 962-973
https://doi.org/10.1109/FOCS.2017.93Author
Cohen-Addad, Vincent Pierre ; Dahlgaard, Søren ; Wulff-Nilsen, Christian. / Fast and Compact Exact Distance Oracle for Planar Grap. 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, 2017. s. 962-973
Bibtex
@inproceedings{fdccdccd9081465a8ef4007e4c6c6468,
title = "Fast and Compact Exact Distance Oracle for Planar Grap",
keywords = "dynamic graph algorithms, minimum spanning forests, graph decomposition",
author = "Cohen-Addad, {Vincent Pierre} and S{\o}ren Dahlgaard and Christian Wulff-Nilsen",
year = "2017",
doi = "10.1109/FOCS.2017.93",
language = "English",
pages = "962--973",
booktitle = "2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS)",
publisher = "IEEE",
note = "null ; Conference date: 15-10-2017 Through 17-10-2017",
}
RIS
TY - GEN
T1 - Fast and Compact Exact Distance Oracle for Planar Grap
AU - Cohen-Addad, Vincent Pierre
AU - Dahlgaard, Søren
AU - Wulff-Nilsen, Christian
N1 - Conference code: 58
PY - 2017
Y1 - 2017
KW - dynamic graph algorithms
KW - minimum spanning forests
KW - graph decomposition
U2 - 10.1109/FOCS.2017.93
DO - 10.1109/FOCS.2017.93
M3 - Article in proceedings
SP - 962
EP - 973
BT - 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS)
PB - IEEE
Y2 - 15 October 2017 through 17 October 2017
ER -
