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
.
Algorithms and Hardness for Diameter in Dynamic Graphs
2019
International Colloquium on Automata, Languages and Programming
The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the ones that follow from trivial recomputation after each update or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally intensive. This is the situation for dynamic approximation algorithms as well, and even if only edge insertions or edge deletions need to be supported. This paper
doi:10.4230/lipics.icalp.2019.13
dblp:conf/icalp/AnconaHRWW19
fatcat:bg2j3huworg7jbf3lt2clk2clm