"Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs."

Adam Karczmarz, Piotr Sankowski (2023)

Details and statistics

DOI: 10.4230/LIPICS.ICALP.2023.84

access: open

type: Conference or Workshop Paper

metadata version: 2023-07-05

a service of  Schloss Dagstuhl - Leibniz Center for Informatics