27 citations · 82 across the 20 of their papers we have counts for
3 papers · 1 filter
Faster Cut Sparsification of Weighted Graphs
Sebastian Forster, Tijn de Vos
A cut sparsifier is a reweighted subgraph that maintains the weights of the cuts of the original graph up to a multiplicative factor of . This paper considers computing cu…
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions
Sebastian Forster, Martin Grösbacher, Tijn de Vos
Spanners have been shown to be a powerful tool in graph algorithms. Many spanner constructions use a certain type of clustering at their core, where each cluster has small diameter…
Fast Deterministic Fully Dynamic Distance Approximation
Jan van den Brand, Sebastian Forster, Yasamin Nazari
In this paper, we develop deterministic fully dynamic algorithms for computing approximate distances in a graph with worst-case update time guarantees. In particular, we obtain imp…