Deterministic walks in randam networks: an application to thesaurus graphs (2002)
Source: Physica A. Unidade: FFCLRP
Subjects: REDES DE COMPUTADORES, TESAUROS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KINOUCHI, Osame et al. Deterministic walks in randam networks: an application to thesaurus graphs. Physica A, v. 315, p. 665-676, 2002Tradução . . Disponível em: https://doi.org/10.1016/s0378-4371(02)00972-x. Acesso em: 14 nov. 2024.APA
Kinouchi, O., Martinez, A. S., Lima, G. F., Lourenço, G. M., & Risau-Gusman, S. (2002). Deterministic walks in randam networks: an application to thesaurus graphs. Physica A, 315, 665-676. doi:10.1016/s0378-4371(02)00972-xNLM
Kinouchi O, Martinez AS, Lima GF, Lourenço GM, Risau-Gusman S. Deterministic walks in randam networks: an application to thesaurus graphs [Internet]. Physica A. 2002 ; 315 665-676.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1016/s0378-4371(02)00972-xVancouver
Kinouchi O, Martinez AS, Lima GF, Lourenço GM, Risau-Gusman S. Deterministic walks in randam networks: an application to thesaurus graphs [Internet]. Physica A. 2002 ; 315 665-676.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1016/s0378-4371(02)00972-x
