20 citations · 76 across the 29 of their papers we have counts for
3 papers · 1 filter
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg +1
Given an -vertex planar embedded digraph with non-negative edge weights and a face of , Klein presented a data structure with space and preprocessing tim…
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier
Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg
Given a directed, weighted graph undergoing edge insertions, the incremental single-source shortest paths (SSSP) problem asks for the maintenance of approximate distances…
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
In the decremental single-source shortest paths problem, the goal is to maintain distances from a fixed source to every vertex in an -edge graph undergoing edge deletion…