Hardness and inapproximability of convex recoloring problems (2014)
Source: Theoretical Computer Science. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS, ANÁLISE DE ALGORITMOS, ALGORITMOS
ABNT
CAMPÊLO, Manoel et al. Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science, v. 533, p. 15-25, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2014.03.017. Acesso em: 17 nov. 2024.APA
Campêlo, M., Huiban, C. G., Sampaio, R. M., & Wakabayashi, Y. (2014). Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science, 533, 15-25. doi:10.1016/j.tcs.2014.03.017NLM
Campêlo M, Huiban CG, Sampaio RM, Wakabayashi Y. Hardness and inapproximability of convex recoloring problems [Internet]. Theoretical Computer Science. 2014 ; 533 15-25.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1016/j.tcs.2014.03.017Vancouver
Campêlo M, Huiban CG, Sampaio RM, Wakabayashi Y. Hardness and inapproximability of convex recoloring problems [Internet]. Theoretical Computer Science. 2014 ; 533 15-25.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1016/j.tcs.2014.03.017