Multilength single pair shortest disjoint paths (2004)
Unidade: IMEAssunto: COMPUTABILIDADE E COMPLEXIDADE
ABNT
FERNANDES, Cristina Gomes e VAN DER HOLST, Hendricus e PINA JÚNIOR, José Coelho de. Multilength single pair shortest disjoint paths. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/1cf774d0-2a32-4b61-9b9b-d0e09bd8f2a4/1372356.pdf. Acesso em: 04 nov. 2024. , 2004APA
Fernandes, C. G., Van der Holst, H., & Pina Júnior, J. C. de. (2004). Multilength single pair shortest disjoint paths. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/1cf774d0-2a32-4b61-9b9b-d0e09bd8f2a4/1372356.pdfNLM
Fernandes CG, Van der Holst H, Pina Júnior JC de. Multilength single pair shortest disjoint paths [Internet]. 2004 ;[citado 2024 nov. 04 ] Available from: https://repositorio.usp.br/directbitstream/1cf774d0-2a32-4b61-9b9b-d0e09bd8f2a4/1372356.pdfVancouver
Fernandes CG, Van der Holst H, Pina Júnior JC de. Multilength single pair shortest disjoint paths [Internet]. 2004 ;[citado 2024 nov. 04 ] Available from: https://repositorio.usp.br/directbitstream/1cf774d0-2a32-4b61-9b9b-d0e09bd8f2a4/1372356.pdf