Reference Work Entry

Encyclopedia of Algorithms

pp 600-602


Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization

  • Monika HenzingerAffiliated withUniversity of Vienna Email author 
  • , Sebastian KrinningerAffiliated withFaculty of Computer Science, University of Vienna
  • , Danupon NanongkaiAffiliated withSchool of Computer Science and Communication, KTH Royal Institute of Technology


Approximation algorithms Data structures Derandomization Dynamic graph algorithms

Years and Authors of Summarized Original Work

  • 2013; Henzinger, Krinninger, Nanongkai

Problem Definition

Given an undirected, unweighted graph with n nodes and m edges that is modified by a sequence of edge insertions and deletions, the problem is to maintain a data structure that quickly answers queries that ask for the length d(u, v) of the shortest path between two arbitrary nodes u and v in the graph, called the distance of u and v. The fastest exact algorithm for this problem is randomized and takes amortized ...

This is an excerpt from the content