Bertie Ancona
YOU?
Author Swipe
View article: Distributed Distance Approximation
Distributed Distance Approximation Open
Diameter, radius and eccentricities are fundamental graph parameters, which are extensively studied in various computational settings. Typically, computing approximate answers can be much more efficient compared with computing exact soluti…
View article: Algorithms and Hardness for Diameter in Dynamic Graphs.
Algorithms and Hardness for Diameter in Dynamic Graphs. Open
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 upda…
View article: Algorithms and Hardness for Diameter in Dynamic Graphs
Algorithms and Hardness for Diameter in Dynamic Graphs Open
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 upda…
View article: Conditional lower bounds for graph sensitivity problems
Conditional lower bounds for graph sensitivity problems Open
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.