Table 1 A benchmark comparison for the algorithms’ performance
From: Managing large distributed dynamic graphs for smart city network applications
Algorithm | Complexity | Source | Remarks |
|---|---|---|---|
Seidel algorithm | O(Vω)logV | ω<2.373 | |
William’s algorithm | \(O\left [\frac {V^{3}}{2^{\Omega (log n^{1/2})}}'\right ]\) |  | |
Floyd-Warshall algorithm | O(V3) | Â | |
Pettie algorithm | O(EV+V2loglogV) | Limited to static graphs | |
Our algorithm | O(EV+V2log2V) | Â | Â |