A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs
2020
European Symposium on Algorithms
Efficient algorithms for computing and processing additively weighted Voronoi diagrams on planar graphs have been instrumental in obtaining several recent breakthrough results, most notably the almost-optimal exact distance oracle for planar graphs [Charalampopoulos et al., STOC'19], and subquadratic algorithms for planar diameter [Cabello, SODA'17, Gawrychowski et al., SODA'18]. In this paper, we show how Voronoi diagrams can be useful in obtaining dynamic planar graph algorithms and apply
doi:10.4230/lipics.esa.2020.31
dblp:conf/esa/Charalampopoulos20
fatcat:5so72hnvf5emrkngtb6rxxznb4