Daniel Villeneuve, Guy Desaulniers. 2005 “The shortest path problem with forbidden paths”. European Journal of Operational Research, vol. 165 (1), pp. 97-107. ISSN: 0377-2217. Elsevier. https://doi.org/10.1016/j.ejor.2004.01.032.
Chiun-Chieh Hsu, Da-Ren Chen, Hua-Yuan Ding. 2009. “An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths”. International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), LNCS 5574, pp.638-650. ISBN: 978-3-642-03095-6. Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-642-03095-6_60
Gabor Csárdi, Tamas Nepusz. 2006. “The igraph Software Package for Complex Network Research,” InterJournal Complex Systems, pp. 1-9. ISSN: 1081-0625 http://www.interjournal.org/manuscript_abstract.php?361100992