ReP USP - Resultado da busca

Filtros : "Discrete Applied Mathematics" "2009" Limpar

Filtros

Artigo de periodico
Approximation algorithms and hardness results for the clique packing problem (2009)
Chataigner, Frederic; Manic, Gerhard; Wakabayashi, Yoshiko ; Yuster, R
Fonte: Discrete Applied Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHATAIGNER, Frederic et al. Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, v. 157, n. 7, p. 1396-1406, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2008.10.017. Acesso em: 09 nov. 2025.
APA
Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2009). Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, 157( 7), 1396-1406. doi:10.1016/j.dam.2008.10.017
NLM
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017
Vancouver
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017
Artigo de periodico
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (2009)
Fernandes, Cristina Gomes ; Lee, Orlando; Wakabayashi, Yoshiko
Fonte: Discrete Applied Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e LEE, Orlando e WAKABAYASHI, Yoshiko. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, n. 2, p. 272-279, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2007.10.032. Acesso em: 09 nov. 2025.
APA
Fernandes, C. G., Lee, O., & Wakabayashi, Y. (2009). Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, ( 2), 272-279. doi:10.1016/j.dam.2007.10.032
NLM
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032
Vancouver
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032

Biblioteca Digital de Produção Intelectual da Universidade de São Paulo 2012 - 2025