[1]
M. J. Kashyop, T. Nagayama, and K. Sadakane, “Faster algorithms for shortest path and network flow based on graph decomposition”, JGAA, vol. 23, no. 5, pp. 781–813, Oct. 2019.