Counting orientations of random graphs with no directed k‐cycles (2024)
Campos, Marcelo; Collares, Maurício 
; Mota, Guilherme Oliveira
Fonte: Random Structures & Algorithms. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Marcelo e COLLARES, Maurício e MOTA, Guilherme Oliveira. Counting orientations of random graphs with no directed k‐cycles. Random Structures & Algorithms, v. 64, n. 3, p. 676-691, 2024Tradução . . Disponível em: https://doi.org/10.1002/rsa.21196. Acesso em: 27 jun. 2024.APA
Campos, M., Collares, M., & Mota, G. O. (2024). Counting orientations of random graphs with no directed k‐cycles. Random Structures & Algorithms, 64( 3), 676-691. doi:10.1002/rsa.21196NLM
Campos M, Collares M, Mota GO. Counting orientations of random graphs with no directed k‐cycles [Internet]. Random Structures & Algorithms. 2024 ; 64( 3): 676-691.[citado 2024 jun. 27 ] Available from: https://doi.org/10.1002/rsa.21196Vancouver
Campos M, Collares M, Mota GO. Counting orientations of random graphs with no directed k‐cycles [Internet]. Random Structures & Algorithms. 2024 ; 64( 3): 676-691.[citado 2024 jun. 27 ] Available from: https://doi.org/10.1002/rsa.21196
