M. Ahmed and A. Lubiw, Shortest paths avoiding forbidden subpaths, Networks, vol.165, issue.4, pp.322-334, 2013.
DOI : 10.1002/net.21490
URL : https://hal.archives-ouvertes.fr/inria-00359710

N. Y. Chen, X. Hua, H. Wan, X. Zhang, and . Zheng, Dynamic lightpath provisioning in optical WDM mesh networks with asymmetric nodes, Photonic Network Communications, vol.1, issue.12, pp.166-177, 2013.
DOI : 10.1007/s11107-013-0400-8

L. Gourvès, A. Lyra, C. A. Martinhon, J. [. Monnot, A. L. Gutiérrez et al., Complexity of trails, paths and circuits in arc-colored digraphs, Discrete Applied Mathematics, vol.161, issue.6, pp.819-828169, 2008.
DOI : 10.1016/j.dam.2012.10.025

M. M. Kante, F. Z. Moataz, B. Momège, N. Nissepg13-]-l, F. Di-puglia-pugliese et al., Finding paths in grids with forbidden transitions Shortest path problem with forbidden paths : The elementary version [Sze03] S. Szeider. Finding paths in graphs avoiding forbidden transitions, Val81] L. G. Valiant. Universality considerations in VLSI circuits. IEEE Transactions on Computers, pp.254-267261, 1981.