Length-bounded disjoint paths in planar graphs (2002)
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: PROGRAMAÇÃO DINÂMICA
ABNT
VAN DER HOLST, Hendricus e PINA JÚNIOR, José Coelho de. Length-bounded disjoint paths in planar graphs. Discrete Applied Mathematics, v. 120, n. 1-3, p. 251-261, 2002Tradução . . Disponível em: https://doi.org/10.1016/S0166-218X(01)00294-3. Acesso em: 08 nov. 2025.APA
Van der Holst, H., & Pina Júnior, J. C. de. (2002). Length-bounded disjoint paths in planar graphs. Discrete Applied Mathematics, 120( 1-3), 251-261. doi:10.1016/S0166-218X(01)00294-3NLM
Van der Holst H, Pina Júnior JC de. Length-bounded disjoint paths in planar graphs [Internet]. Discrete Applied Mathematics. 2002 ; 120( 1-3): 251-261.[citado 2025 nov. 08 ] Available from: https://doi.org/10.1016/S0166-218X(01)00294-3Vancouver
Van der Holst H, Pina Júnior JC de. Length-bounded disjoint paths in planar graphs [Internet]. Discrete Applied Mathematics. 2002 ; 120( 1-3): 251-261.[citado 2025 nov. 08 ] Available from: https://doi.org/10.1016/S0166-218X(01)00294-3
