Skip to main content

Table 1 A benchmark comparison for the algorithms’ performance

From: Managing large distributed dynamic graphs for smart city network applications

AlgorithmComplexitySourceRemarks
Seidel algorithmO(Vω)logV(Seidel 1995)ω<2.373
William’s algorithm\(O\left [\frac {V^{3}}{2^{\Omega (log n^{1/2})}}'\right ]\)(Williams 2013) 
Floyd-Warshall algorithmO(V3)(Floyd 1962) 
Pettie algorithmO(EV+V2loglogV)(Pettie 2004)Limited to static graphs
Our algorithmO(EV+V2log2V)