A 5/3-approximation for finding spanning trees with many leaves in cubic graphs (2008)
Correa, Jose R; Fernandes, Cristina Gomes 
; Matamala, Martin; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Workshop on Approximation and Online Algorithms. Unidade: IME
Subjects: ALGORITMOS, APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CORREA, Jose R et al. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-77918-6_15. Acesso em: 30 set. 2024.APA
Correa, J. R., Fernandes, C. G., Matamala, M., & Wakabayashi, Y. (2008). A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-77918-6_15NLM
Correa JR, Fernandes CG, Matamala M, Wakabayashi Y. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs [Internet]. Proceedings. 2008 ;[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/978-3-540-77918-6_15Vancouver
Correa JR, Fernandes CG, Matamala M, Wakabayashi Y. A 5/3-approximation for finding spanning trees with many leaves in cubic graphs [Internet]. Proceedings. 2008 ;[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/978-3-540-77918-6_15
