Fast and Compact Exact Distance Oracle for Planar Grap

Vincent Pierre Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

38 Citations (Scopus)

Abstract

Original language	English
Title of host publication	2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS)
Publisher	IEEE
Publication date	2017
Pages	962-973
DOIs	https://doi.org/10.1109/FOCS.2017.93
Publication status	Published - 2017
Event	58th Annual IEEE Symposium on Foundations of Computer Science - Berkeley, United States Duration: 15 Oct 2017 → 17 Oct 2017 Conference number: 58

Conference	58th Annual IEEE Symposium on Foundations of Computer Science
Number	58
Country/Territory	United States
City	Berkeley
Period	15/10/2017 → 17/10/2017

@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",

}

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 -