Source: Network Science. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUZMAN, Grover Enrique Castro e STADLER, Peter F. e FUJITA, André. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions. Network Science, v. 9, n. 3, p. 312-327, 2021Tradução . . Disponível em: https://doi.org/10.1017/nws.2021.10. Acesso em: 26 ago. 2024.APA
Guzman, G. E. C., Stadler, P. F., & Fujita, A. (2021). Efficient Laplacian spectral density computations for networks with arbitrary degree distributions. Network Science, 9( 3), 312-327. doi:10.1017/nws.2021.10NLM
Guzman GEC, Stadler PF, Fujita A. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions [Internet]. Network Science. 2021 ; 9( 3): 312-327.[citado 2024 ago. 26 ] Available from: https://doi.org/10.1017/nws.2021.10Vancouver
Guzman GEC, Stadler PF, Fujita A. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions [Internet]. Network Science. 2021 ; 9( 3): 312-327.[citado 2024 ago. 26 ] Available from: https://doi.org/10.1017/nws.2021.10