ReP USP - Resultado da busca

Filtros : "San Diego" "Financiado pelo MCTI" Removido: "FZEA-ZMV" Limpar

Filtros

Artigo de periodico
Hypergraphs, quasi-randomness, and conditions for regularity (2002)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Skokan, Jozef
Source: Journal of Combinatorial Theory. Ser. A. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SKOKAN, Jozef. Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, v. 97, n. 2, p. 307-352, 2002Tradução . . Disponível em: https://doi.org/10.1006/jcta.2001.3217. Acesso em: 04 set. 2024.
APA
Kohayakawa, Y., Rodl, V., & Skokan, J. (2002). Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, 97( 2), 307-352. doi:10.1006/jcta.2001.3217
NLM
Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 set. 04 ] Available from: https://doi.org/10.1006/jcta.2001.3217
Vancouver
Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 set. 04 ] Available from: https://doi.org/10.1006/jcta.2001.3217
Artigo de periodico
Finding skew partitions efficiently (2000)
Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A.
Source: Journal of Algorithms. Unidade: IME
Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FIGUEIREDO, Celina Miraglia Herrera de et al. Finding skew partitions efficiently. Journal of Algorithms, v. 37, n. 2, p. 505-521, 2000Tradução . . Disponível em: https://doi.org/10.1006/jagm.1999.1122. Acesso em: 04 set. 2024.
APA
Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. Journal of Algorithms, 37( 2), 505-521. doi:10.1006/jagm.1999.1122
NLM
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 set. 04 ] Available from: https://doi.org/10.1006/jagm.1999.1122
Vancouver
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 set. 04 ] Available from: https://doi.org/10.1006/jagm.1999.1122

Digital Library of Intellectual Production of Universidade de São Paulo 2012 - 2024