Algorithms and hardness for diameter in dynamic graphs
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; licensed under Creative Commons License CC-BY The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorith...
Main Authors: | Williams, Virginia Vassilevska, Ancona, Bertie, Wein, Nicole |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137486 |
Similar Items
-
Algorithms and Hardness for Approximating the Diameter of a Graph
by: Wein, Nicole Spence
Published: (2022) -
Tight approximation algorithms for bichromatic graph diameter and related problems
by: Dalirrooyfard, Mina, et al.
Published: (2021) -
Hardness of Approximate Diameter: Now for Undirected Graphs
by: Dalirrooyfard, Mina, et al.
Published: (2022) -
Hardness of Approximate Diameter: Now for Undirected Graphs
by: Dalirrooyfard, Mina, et al.
Published: (2024) -
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
by: Probst Gutenberg, Maximilian, et al.
Published: (2021)