Guzman, Grover Enrique Castro 
; Fujita, André
Fonte: Journal of Complex Networks. Unidade: IME
Assuntos: GRAFOS ALEATÓRIOS, TEORIA ESPECTRAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUZMAN, Grover Enrique Castro e FUJITA, André. A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity. Journal of Complex Networks, v. 11, n. 2, p. 1-15, 2023Tradução . . Disponível em: https://doi.org/10.1093/comnet/cnad005. Acesso em: 09 nov. 2025.APA
Guzman, G. E. C., & Fujita, A. (2023). A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity. Journal of Complex Networks, 11( 2), 1-15. doi:10.1093/comnet/cnad005NLM
Guzman GEC, Fujita A. A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity [Internet]. Journal of Complex Networks. 2023 ; 11( 2): 1-15.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1093/comnet/cnad005Vancouver
Guzman GEC, Fujita A. A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity [Internet]. Journal of Complex Networks. 2023 ; 11( 2): 1-15.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1093/comnet/cnad005
