Dynamic single-source shortest paths in erdös-rényi random graphs

Abstract

This paper studies the dynamic single-source shortest paths (SSSP) in Erdös-Rényi random graphs generated by G(n, p) model. In 2014, Ding and Lin (AAIM 2014, LNCS 8546, 197–207) first considered the dynamic SSSP in general digraphs with arbitrary positive weights, and devised a nontrivial local search algorithm named DSPI which takes at most O(n⋅max{1,nlogn/m}) expected update time to handle a single weight increase, where n is the number of nodes and m is the number of edges in the digraph. DSPI also works on undirected graphs. This paper analyzes the expected update time of DSPI dealing with edge weight increases or edge deletions in Erdös-Rényi (a.k.a., G(n, p)) random graphs. For weighted G(n, p) random graphs with arbitrary positive edge weights, DSPI takes at most O(h(Ts)) expected update time to deal with a single edge weight increase as well as O(pn2h(Ts)) total update time, where h(Ts) is the height of input SSSP tree Ts. For G(n, p) random graphs, DSPI takes O(ln n) expected update time to handle a single edge deletion as well as O(pn2ln n) total update time (Formula Presented.) and O(1) expected update time to handle a single edge deletion as well as O(pn2) total update time (Formula Presented.). Specifically, DSPI takes the least total update time of O(n ln nh(Ts)) for weighted G(n, p) random graphs with (Formula Presented.) as well as O(n3/2(ln n)1/2) for G(n, p) random graphs (Formula Presented.).