On the complexity of solving or approximating convex recoloring problems (2013)
Source: Proceedings. Conference titles: International Computing and Combinatorics Conference - COCOON. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO
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: 01 set. 2024.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 2024 set. 01 ] 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 2024 set. 01 ] Available from: https://doi.org/10.1007/978-3-642-38768-5_54