Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Decremental APSP in Directed Graphs Versus an Adaptive Adversary
Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg +1
Given a directed graph , undergoing an online sequence of edge deletions with edges in the initial version of and , we consider the problem of maintaini…
cs.DS2020
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs
Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen
Given an undirected, unweighted planar graph with vertices, we present a truly subquadratic size distance oracle for reporting exact shortest-path distances between any pai…