Decremental APSP in unweighted digraphs versus an adaptive adversary

Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff- Nilsen · 2021 · DOI 10.4230/lipics.icalp.2021.64

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2026-06-01 · unverdicted · novelty 8.0

First offline dynamic APSP algorithm for planar digraphs with Õ(√n) update and query time via faster maintenance of dense distance graphs.

Showing 1 of 1 citing paper.

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs cs.DS · 2026-06-01 · unverdicted · none · ref 16
First offline dynamic APSP algorithm for planar digraphs with Õ(√n) update and query time via faster maintenance of dense distance graphs.