Polynomial algorithms for sparse spanners on subcubic graphs (2024)
Gómez, Renzo 
; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS GRÁFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Polynomial algorithms for sparse spanners on subcubic graphs. Journal of Combinatorial Optimization, v. 48, n. artigo 11, p. 1-21, 2024Tradução . . Disponível em: https://doi.org/10.1007/s10878-024-01197-9. Acesso em: 13 nov. 2025.APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2024). Polynomial algorithms for sparse spanners on subcubic graphs. Journal of Combinatorial Optimization, 48( artigo 11), 1-21. doi:10.1007/s10878-024-01197-9NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Polynomial algorithms for sparse spanners on subcubic graphs [Internet]. Journal of Combinatorial Optimization. 2024 ; 48( artigo 11): 1-21.[citado 2025 nov. 13 ] Available from: https://doi.org/10.1007/s10878-024-01197-9Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Polynomial algorithms for sparse spanners on subcubic graphs [Internet]. Journal of Combinatorial Optimization. 2024 ; 48( artigo 11): 1-21.[citado 2025 nov. 13 ] Available from: https://doi.org/10.1007/s10878-024-01197-9
