Efficient associative algorithm for finding the second simple shortest paths in a digraph
Nepomniaschaya A.S. Efficient associative algorithm for finding the second simple shortest paths in a digraph // Proceedings of the 11th International Conference on Parallel Computing Technologies (PaCT-2011), LNCS, Vol. 6873. 2011. P. 182-191. DOI: 10.1007/978-3-642-23178-0_16