Polyhedral studies on the convex recoloring problem (2013)
Fonte: Electronic Notes in Discrete Mathematics. Nome do evento: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidades: EACH, IME
Assuntos: ALGORITMOS, POLIEDROS
ABNT
CAMPÊLO, Manoel et al. Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2013.10.036. Acesso em: 08 nov. 2025. , 2013APA
Campêlo, M., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2013). Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. doi:10.1016/j.endm.2013.10.036NLM
Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2025 nov. 08 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036Vancouver
Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2025 nov. 08 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036
