On the complexity of solving or approximating convex recoloring problems (2013)
Campêlo, Manoel B 
; Huiban, Cristiana Gomes ; Sampaio, Rudini Menezes ; Wakabayashi, Yoshiko
Fonte: Proceedings. Nome do evento: International Computing and Combinatorics Conference - COCOON. Unidade: IME
Assuntos: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel B et al. On the complexity of solving or approximating convex recoloring problems. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://doi.org/10.1007/978-3-642-38768-5_54. Acesso em: 09 nov. 2025.APA
Campêlo, M. B., Huiban, C. G., Sampaio, R. M., & Wakabayashi, Y. (2013). On the complexity of solving or approximating convex recoloring problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-38768-5_54NLM
Campêlo MB, Huiban CG, Sampaio RM, Wakabayashi Y. On the complexity of solving or approximating convex recoloring problems [Internet]. Proceedings. 2013 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54Vancouver
Campêlo MB, Huiban CG, Sampaio RM, Wakabayashi Y. On the complexity of solving or approximating convex recoloring problems [Internet]. Proceedings. 2013 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54
