A new approach to dynamic all pairs shortest paths

DOI10.1145/780542.780567zbMath1192.90223OpenAlexW1968023964MaRDI QIDQ3581293

Giuseppe F. Italiano, Camil Demetrescu

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780567

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items

A Dynamic Algorithm for Reachability Games Played on Trees ⋮ Inductive computations on graphs defined by clique-width expressions ⋮ Dynamically maintaining split graphs