The following publications are possibly variants of this publication:
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networksJosé M. F. Craveirinha, Marta Pascoal, João C. N. Clímaco. infor, 61(3):399-418, August 2023. [doi]
- Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networksTeresa Gomes, Luísa Jorge, Paulo Melo, Rita Girão-Silva, Sergio Mendes. drcn 2013: 314-321 [doi]
- Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approachTeresa Gomes, Luísa Jorge, Paulo Melo, Rita Girão-Silva. pnc, 31(1):11-22, 2016. [doi]
- Obtaining a SRLG-disjoint path pair of min-sum costTeresa Gomes, Luis Fernandes. icumt 2010: 582-588 [doi]
- SRLG failure-disjoint path pair of min-sum cost in GMPLS networksTeresa Gomes, José Silva, José M. F. Craveirinha, Carlos Simoes. drcn 2011: 196-203 [doi]
- Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum costTeresa Gomes, Carlos Simoes, Luis Fernandes. telsys, 52(2):737-749, 2013. [doi]
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networksTeresa Gomes, José M. F. Craveirinha. eor, 181(3):1055-1064, 2007. [doi]