X. Luo and B. Wang, Diverse routing in WDM optical networks with shared risk link group (SRLG) failures, Proc. DRCN. IEEE, pp.445-452, 2005.

J. Doucette and W. Grover, Shared-Risk Logical Span Groups in Span-Restorable Optical Networks: Analysis and Capacity Planning Model, Photonic Network Communications, vol.18, issue.10, pp.35-53, 2005.
DOI : 10.1007/s11107-005-4530-5

D. Coudert, P. Datta, S. Perennes, H. Rivano, and M. Voge, SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUES, Parallel Processing Letters, vol.17, issue.02, pp.169-184, 2007.
DOI : 10.1142/S0129626407002958
URL : https://hal.archives-ouvertes.fr/hal-00371100

D. Coudert, S. Perennes, H. Rivano, and M. Voge, Shared risk resource groups and colored graph: Polynomial and FPT optimisation problems

J. Hu, Diverse routing in mesh optical networks, IEEE Transactions on Communications, vol.51, pp.489-494, 2003.

G. Ellinas, E. Bouillet, R. Ramamurthy, J. Labourdette, S. Chauduri et al., Routing and restoration architectures in mesh optical networks, Optical Networks Magazine, pp.91-106, 2003.

G. Li, C. Kalmanek, and R. Doverspike, Fiber span failure protection in mesh optical networks, OptiComm 2001: Optical Networking and Communications, pp.21-31, 2002.
DOI : 10.1117/12.436053

E. Modiano and A. Narula-tam, Survivable lightpath routing: a new approach to the design of WDM-based networks, IEEE Journal on Selected Areas in Communications, vol.20, issue.4, pp.800-809, 2002.
DOI : 10.1109/JSAC.2002.1003045

P. Datta and A. Somani, Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures, Computer Networks, vol.52, issue.12, pp.2381-2394, 2008.
DOI : 10.1016/j.comnet.2008.04.017

R. Bhandari, Survivable Networks: Algorithms for Diverse Routing, 1998.

S. Szeider, Finding paths in graphs avoiding forbidden transitions, Discrete Applied Mathematics, vol.126, issue.2-3, pp.261-273, 2003.
DOI : 10.1016/S0166-218X(02)00251-2

J. Bermond, D. Coudert, G. D. Angelo, and F. Z. Moataz, Diverse Routing with the star property, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00733869

A. Björklund, T. Husfeldt, and M. Koivisto, Set Partitioning via Inclusion-Exclusion, SIAM Journal on Computing, vol.39, issue.2, pp.546-563, 2009.
DOI : 10.1137/070683933

J. E. Hopcroft and R. E. Tarjan, Dividing a Graph into Triconnected Components, SIAM Journal on Computing, vol.2, issue.3, pp.135-158, 1973.
DOI : 10.1137/0202012

V. T. Chakaravarthy, New results on the computability and complexity of points?to analysis, ACM SIGPLAN-SIGACT symposium on principles of programming languages (POPL, pp.115-125, 2003.

G. Ausiello, A. D. Atri, and M. Protasi, Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences, vol.21, issue.1, pp.136-153, 1980.
DOI : 10.1016/0022-0000(80)90046-X
URL : http://doi.org/10.1016/0022-0000(80)90046-x

P. Berman and T. Fujito, On approximation properties of the Independent set problem for degree 3 graphs, 4th International Workshop on Algorithms and Data Structures (WADS), ser. Lecture Notes in Computer Science, pp.449-460, 1995.
DOI : 10.1007/3-540-60220-8_84

V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters, vol.37, issue.1, pp.27-35, 1991.
DOI : 10.1016/0020-0190(91)90246-E