ReP USP - Resultado da busca

Artigo de periodico
The Kuramoto model in complex networks (2016)
Rodrigues, Francisco Aparecido ; Peron, Thomas ; Ji, Peng; Kurths, Jürgen
Source: Physics Reports. Unidade: ICMC
Subjects: REDES COMPLEXAS, TEORIA DOS GRAFOS, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RODRIGUES, Francisco Aparecido et al. The Kuramoto model in complex networks. Physics Reports, v. 610, n. Ja 2016, p. 1-98, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.physrep.2015.10.008. Acesso em: 16 out. 2024.
APA
Rodrigues, F. A., Peron, T., Ji, P., & Kurths, J. (2016). The Kuramoto model in complex networks. Physics Reports, 610( Ja 2016), 1-98. doi:10.1016/j.physrep.2015.10.008
NLM
Rodrigues FA, Peron T, Ji P, Kurths J. The Kuramoto model in complex networks [Internet]. Physics Reports. 2016 ; 610( Ja 2016): 1-98.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/j.physrep.2015.10.008
Vancouver
Rodrigues FA, Peron T, Ji P, Kurths J. The Kuramoto model in complex networks [Internet]. Physics Reports. 2016 ; 610( Ja 2016): 1-98.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/j.physrep.2015.10.008
Trabalho de evento-anais periodico
A counting lemma for sparse pseudorandom hypergraphs (2015)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias; Taraz, Anusch
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. A counting lemma for sparse pseudorandom hypergraphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.070. Acesso em: 16 out. 2024. , 2015
APA
Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2015). A counting lemma for sparse pseudorandom hypergraphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.070
NLM
Kohayakawa Y, Mota GO, Schacht M, Taraz A. A counting lemma for sparse pseudorandom hypergraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 421-426.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/j.endm.2015.07.070
Vancouver
Kohayakawa Y, Mota GO, Schacht M, Taraz A. A counting lemma for sparse pseudorandom hypergraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 421-426.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/j.endm.2015.07.070
Trabalho de evento-anais periodico
On minimum bisection and related partition problems in graphs with bounded tree width (2015)
Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications -EuroComb. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related partition problems in graphs with bounded tree width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.06.067. Acesso em: 16 out. 2024. , 2015
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2015). On minimum bisection and related partition problems in graphs with bounded tree width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.067
NLM
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067

USP Schools

ReP

Filtros

Authors