Strong intractability results for generalized convex recoloring problems (2020)
Moura, Phablo Fernando Soares 
; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.dam.2019.08.002. Acesso em: 19 nov. 2025. , 2020APA
Moura, P. F. S., & Wakabayashi, Y. (2020). Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. doi:10.1016/j.dam.2019.08.002NLM
Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002Vancouver
Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002
