ReP USP - Resultado da busca

Artigo de periodico-apres/intr
Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface] (2004)
Reed, Bruce A; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REED, Bruce A e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface]. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S0166-218X(03)00362-7. Acesso em: 01 out. 2024. , 2004
APA
Reed, B. A., Song, S. W., & Szwarcfiter, J. L. (2004). Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface]. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S0166-218X(03)00362-7
NLM
Reed BA, Song SW, Szwarcfiter JL. Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface] [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 1.[citado 2024 out. 01 ] Available from: https://doi.org/10.1016/S0166-218X(03)00362-7
Vancouver
Reed BA, Song SW, Szwarcfiter JL. Brazilian Symposium on Graphs, Algorithms and Combinatorics. [Preface] [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 1.[citado 2024 out. 01 ] Available from: https://doi.org/10.1016/S0166-218X(03)00362-7
Artigo de periodico
A parallel algorithm for finding small sets of genes that are enough to distinguish two biological states (2004)
Torres, Martha; Barrera, Júnior
Source: Genetics and Molecular Biology. Unidade: IME
Subjects: EXPRESSÃO GÊNICA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TORRES, Martha e BARRERA, Júnior. A parallel algorithm for finding small sets of genes that are enough to distinguish two biological states. Genetics and Molecular Biology, v. 27, n. 4, p. 686-690, 2004Tradução . . Disponível em: https://doi.org/10.1590/S1415-47572004000400034. Acesso em: 01 out. 2024.
APA
Torres, M., & Barrera, J. (2004). A parallel algorithm for finding small sets of genes that are enough to distinguish two biological states. Genetics and Molecular Biology, 27( 4), 686-690. doi:10.1590/S1415-47572004000400034
NLM
Torres M, Barrera J. A parallel algorithm for finding small sets of genes that are enough to distinguish two biological states [Internet]. Genetics and Molecular Biology. 2004 ; 27( 4): 686-690.[citado 2024 out. 01 ] Available from: https://doi.org/10.1590/S1415-47572004000400034
Vancouver
Torres M, Barrera J. A parallel algorithm for finding small sets of genes that are enough to distinguish two biological states [Internet]. Genetics and Molecular Biology. 2004 ; 27( 4): 686-690.[citado 2024 out. 01 ] Available from: https://doi.org/10.1590/S1415-47572004000400034
Trabalho de evento-anais periodico
Approximation results on balanced connected partitions of graphs (2004)
Salgado, Liliane Rose Benning; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Conference on Combinatorics,Graphs and Applications. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SALGADO, Liliane Rose Benning e WAKABAYASHI, Yoshiko. Approximation results on balanced connected partitions of graphs. 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.2004.06.033. Acesso em: 01 out. 2024. , 2004
APA
Salgado, L. R. B., & Wakabayashi, Y. (2004). Approximation results on balanced connected partitions of graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2004.06.033
NLM
Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.[citado 2024 out. 01 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033
Vancouver
Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.[citado 2024 out. 01 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033
Trabalho de evento
Lempel, Even, and Cederbaum planarity method (2004)
Boyer, John M; Fernandes, Cristina Gomes ; Noma, Alexandre ; Pina Júnior, José Coelho de
Source: Proceedings. Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOYER, John M et al. Lempel, Even, and Cederbaum planarity method. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24838-5_10. Acesso em: 01 out. 2024.
APA
Boyer, J. M., Fernandes, C. G., Noma, A., & Pina Júnior, J. C. de. (2004). Lempel, Even, and Cederbaum planarity method. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24838-5_10
NLM
Boyer JM, Fernandes CG, Noma A, Pina Júnior JC de. Lempel, Even, and Cederbaum planarity method [Internet]. Proceedings. 2004 ;[citado 2024 out. 01 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_10
Vancouver
Boyer JM, Fernandes CG, Noma A, Pina Júnior JC de. Lempel, Even, and Cederbaum planarity method [Internet]. Proceedings. 2004 ;[citado 2024 out. 01 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_10

USP Schools

ReP

Filtros

Authors