On the circuit cover problem for mixed graphs (2002)
Lee, Orlando; Wakabayashi, Yoshiko 
Source: Combinatorics, Probability & Computing. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEE, Orlando e WAKABAYASHI, Yoshiko. On the circuit cover problem for mixed graphs. Combinatorics, Probability & Computing, v. 11, n. 1, p. 43-59, 2002Tradução . . Disponível em: https://doi.org/10.1017/S0963548301004989. Acesso em: 13 jun. 2024.APA
Lee, O., & Wakabayashi, Y. (2002). On the circuit cover problem for mixed graphs. Combinatorics, Probability & Computing, 11( 1), 43-59. doi:10.1017/S0963548301004989NLM
Lee O, Wakabayashi Y. On the circuit cover problem for mixed graphs [Internet]. Combinatorics, Probability & Computing. 2002 ; 11( 1): 43-59.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1017/S0963548301004989Vancouver
Lee O, Wakabayashi Y. On the circuit cover problem for mixed graphs [Internet]. Combinatorics, Probability & Computing. 2002 ; 11( 1): 43-59.[citado 2024 jun. 13 ] Available from: https://doi.org/10.1017/S0963548301004989
