Average update times for fully-dynamic all-pairs shortest paths
نویسندگان
چکیده
منابع مشابه
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
We study the fully-dynamic all pairs shortest path problem for graphs with arbitrary non-negative edge weights. It is known for digraphs that an update of the distance matrix costs Õ(n) worst-case time [Thorup, STOC ’05] and Õ(n) amortized time [Demetrescu and Italiano, J.ACM ’04] where n is the number of vertices. We present the first average-case analysis of the undirected problem. For a rand...
متن کاملAverage Update Times for Fully-Dynamic All-Pairs Shortest PathsI
We study the fully-dynamic all pairs shortest path problem for graphs with arbitrary non-negative edge weights. It is known for digraphs that an update of the distance matrix costs O(n2.75 polylog(n)) worst-case time [Thorup, STOC ’05] and O(n2 log(n)) amortized time [Demetrescu and Italiano, J.ACM ’04] where n is the number of vertices. We present the first average-case analysis of the undirec...
متن کاملFully Dynamic All Pairs All Shortest Paths
We consider the all pairs all shortest paths (APASP) problem, which maintains all of the multiple shortest paths for every vertex pair in a directed graph G = (V,E) with a positive real weight on each edge. We present a fully dynamic algorithm for this problem in which an update supports either weight increases or weight decreases on a subset of edges incident to a vertex. Our algorithm runs in...
متن کاملFully Dynamic All Pairs Shortest Paths with Real Edge Weights
We present the first fully dynamic algorithm for maintaining all pairs shortest paths in directed graphs with real-valued edge weights. Given a dynamic directed graph G such that each edge can assume at most S different real values, we show how to support updates in O(n2.5 √ S log n ) amortized time and queries in optimal worst-case time. No previous fully dynamic algorithm was known for this p...
متن کاملFully dynamic all-pairs shortest paths with worst-case update-time revisited
We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges. We give worst-case guarantees on the time needed to process a single update (in contrast to related results, the update time is not amortized over a sequence of updates). Our main res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.02.007