Counting orientations of random graphs with no directed k‐cycles (2023)
Fonte: Random Structures & Algorithms. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
ABNT
CAMPOS, Marcelo e COLLARES, Maurício e MOTA, Guilherme Oliveira. Counting orientations of random graphs with no directed k‐cycles. Random Structures & Algorithms, 2023Tradução . . Disponível em: https://doi.org/10.1002/rsa.21196. Acesso em: 28 mar. 2024.APA
Campos, M., Collares, M., & Mota, G. O. (2023). Counting orientations of random graphs with no directed k‐cycles. Random Structures & Algorithms. 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. 2023 ;[citado 2024 mar. 28 ] 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. 2023 ;[citado 2024 mar. 28 ] Available from: https://doi.org/10.1002/rsa.21196