Average Update Times for Fully-Dynamic All-Pairs Shortest Paths

DOI10.1007/978-3-540-92182-0_61zbMath1183.68763OpenAlexW1547077171MaRDI QIDQ3596762

Nils Hebbinghaus, Tobias Friedrich

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_61

zbMATH Keywords

random graphsshortest pathsaverage-case analysisdynamic graph algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Average update times for fully-dynamic all-pairs shortest paths

This page was built for publication: Average Update Times for Fully-Dynamic All-Pairs Shortest Paths