Filtros : "TEORIA DOS GRAFOS" Limpar

Filtros



Refine with date range

Vocabulário Controlado do SIBiUSP


  • Source: Discrete Applied Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LINTZMAYER, Carla Negri; MOTA‬, ‪Guilherme Oliveira; SAMBINELLI, Maycon. Decomposing split graphs into locally irregular graphs. Discrete Applied Mathematics, Amsterdam, Elsevier, v. 292, p. 33-44, 2021. Disponível em: < https://doi.org/10.1016/j.dam.2020.12.002 > DOI: 10.1016/j.dam.2020.12.002.
    • APA

      Lintzmayer, C. N., Mota‬, ‪G. O., & Sambinelli, M. (2021). Decomposing split graphs into locally irregular graphs. Discrete Applied Mathematics, 292, 33-44. doi:10.1016/j.dam.2020.12.002
    • NLM

      Lintzmayer CN, Mota‬ ‪GO, Sambinelli M. Decomposing split graphs into locally irregular graphs [Internet]. Discrete Applied Mathematics. 2021 ; 292 33-44.Available from: https://doi.org/10.1016/j.dam.2020.12.002
    • Vancouver

      Lintzmayer CN, Mota‬ ‪GO, Sambinelli M. Decomposing split graphs into locally irregular graphs [Internet]. Discrete Applied Mathematics. 2021 ; 292 33-44.Available from: https://doi.org/10.1016/j.dam.2020.12.002
  • Source: Discrete Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BOTLER, Fábio Happ; FERNANDES, Cristina Gomes; GUTIÉRREZ, Juan. On Tuza’s conjecture for triangulations and graphs with small treewidth. Discrete Mathematics, Amsterdam, Elsevier, v. 344, n. 4, p. 1-12, 2021. Disponível em: < https://doi.org/10.1016/j.disc.2020.112281 > DOI: 10.1016/j.disc.2020.112281.
    • APA

      Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2021). On Tuza’s conjecture for triangulations and graphs with small treewidth. Discrete Mathematics, 344( 4), 1-12. doi:10.1016/j.disc.2020.112281
    • NLM

      Botler FH, Fernandes CG, Gutiérrez J. On Tuza’s conjecture for triangulations and graphs with small treewidth [Internet]. Discrete Mathematics. 2021 ; 344( 4): 1-12.Available from: https://doi.org/10.1016/j.disc.2020.112281
    • Vancouver

      Botler FH, Fernandes CG, Gutiérrez J. On Tuza’s conjecture for triangulations and graphs with small treewidth [Internet]. Discrete Mathematics. 2021 ; 344( 4): 1-12.Available from: https://doi.org/10.1016/j.disc.2020.112281
  • Source: Journal of Graph Theory. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Disponível em 2021-04-18Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      HAN, Jie; KOHAYAKAWA, Yoshiharu; MORRIS, Patrick; PERSON, Yury. Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, New York, Wiley, v. 96, n. 1, p. 87-108, 2021. Disponível em: < http://dx.doi.org/10.1002/jgt.22576 > DOI: 10.1002/jgt.22576.
    • APA

      Han, J., Kohayakawa, Y., Morris, P., & Person, Y. (2021). Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, 96( 1), 87-108. doi:10.1002/jgt.22576
    • NLM

      Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.Available from: http://dx.doi.org/10.1002/jgt.22576
    • Vancouver

      Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.Available from: http://dx.doi.org/10.1002/jgt.22576
  • Source: European Journal of Operational Research. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Disponível em 2023-01-05Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MIYAZAWA, Flavio Keidi; MOURA, Phablo Fernando Soares; OTA, Matheus Jun; WAKABAYASHI, Yoshiko. Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, Amsterdam, Elsevier, 2021. Disponível em: < https://doi.org/10.1016/j.ejor.2020.12.059 > DOI: 10.1016/j.ejor.2020.12.059.
    • APA

      Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2021). Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research. doi:10.1016/j.ejor.2020.12.059
    • NLM

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ;Available from: https://doi.org/10.1016/j.ejor.2020.12.059
    • Vancouver

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ;Available from: https://doi.org/10.1016/j.ejor.2020.12.059
  • Source: Discrete & Computational Geometry. Unidade: IME

    Subjects: ENUMERAÇÃO E IDENTIDADE COMBINATÓRIAS, TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERNANDES, Cristina Gomes; PINA JÚNIOR, José Coelho de; RAMÍREZ ALFONSÍN, Jorge Luis; ROBINS, Sinai. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon. Discrete & Computational Geometry, New York, Springer, v. 65, n. 1, p. 227-243, 2021. Disponível em: < https://doi.org/10.1007/s00454-020-00192-1 > DOI: 10.1007/s00454-020-00192-1.
    • APA

      Fernandes, C. G., Pina Júnior, J. C. de, Ramírez Alfonsín, J. L., & Robins, S. (2021). Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon. Discrete & Computational Geometry, 65( 1), 227-243. doi:10.1007/s00454-020-00192-1
    • NLM

      Fernandes CG, Pina Júnior JC de, Ramírez Alfonsín JL, Robins S. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon [Internet]. Discrete & Computational Geometry. 2021 ; 65( 1): 227-243.Available from: https://doi.org/10.1007/s00454-020-00192-1
    • Vancouver

      Fernandes CG, Pina Júnior JC de, Ramírez Alfonsín JL, Robins S. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon [Internet]. Discrete & Computational Geometry. 2021 ; 65( 1): 227-243.Available from: https://doi.org/10.1007/s00454-020-00192-1
  • Conference titles: Latin American Symposium - LATIN. Unidade: IME

    Subjects: TEORIA DA COMPUTAÇÃO, COMBINATÓRIA, TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu; MIYAZAWA, Flavio Keidi. LATIN 2020: theoretical informatics. [S.l: s.n.], 2020.Disponível em: DOI: 10.1007/978-3-030-61792-9.
    • APA

      Kohayakawa, Y., & Miyazawa, F. K. (2020). LATIN 2020: theoretical informatics. Cham: Springer. doi:10.1007/978-3-030-61792-9
    • NLM

      Kohayakawa Y, Miyazawa FK. LATIN 2020: theoretical informatics [Internet]. 2020 ;Available from: https://doi.org/10.1007/978-3-030-61792-9
    • Vancouver

      Kohayakawa Y, Miyazawa FK. LATIN 2020: theoretical informatics [Internet]. 2020 ;Available from: https://doi.org/10.1007/978-3-030-61792-9
  • Source: International Journal of Environmental Research and Public Health. Unidade: IME

    Subjects: ADOLESCENTES, TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      OKU, Amanda Yumi Ambriola; MORAIS, Guilherme Augusto Zimeo; BUENO, Ana Paula Arantes; FUJITA, André; SATO, João Ricardo. Potential confounders in the analysis of Brazilian adolescent’s health: a combination of machine learning and graph theory. International Journal of Environmental Research and Public Health, Basel, MDPI, v. 17, n. 1, p. 1-10, 2020. Disponível em: < http://dx.doi.org/10.3390/ijerph17010090 > DOI: 10.3390/ijerph17010090.
    • APA

      Oku, A. Y. A., Morais, G. A. Z., Bueno, A. P. A., Fujita, A., & Sato, J. R. (2020). Potential confounders in the analysis of Brazilian adolescent’s health: a combination of machine learning and graph theory. International Journal of Environmental Research and Public Health, 17( 1), 1-10. doi:10.3390/ijerph17010090
    • NLM

      Oku AYA, Morais GAZ, Bueno APA, Fujita A, Sato JR. Potential confounders in the analysis of Brazilian adolescent’s health: a combination of machine learning and graph theory [Internet]. International Journal of Environmental Research and Public Health. 2020 ; 17( 1): 1-10.Available from: http://dx.doi.org/10.3390/ijerph17010090
    • Vancouver

      Oku AYA, Morais GAZ, Bueno APA, Fujita A, Sato JR. Potential confounders in the analysis of Brazilian adolescent’s health: a combination of machine learning and graph theory [Internet]. International Journal of Environmental Research and Public Health. 2020 ; 17( 1): 1-10.Available from: http://dx.doi.org/10.3390/ijerph17010090
  • Source: Journal of Combinatorial Theory, Series B. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      HAN, Jie; JENSSEN, Matthew; KOHAYAKAWA, Yoshiharu; MOTA, Guilherme Oliveira; ROBERTS, Barnaby. The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory, Series B, New York, Elsevier, v. 145, p. 359-375, 2020. Disponível em: < https://doi.org/10.1016/j.jctb.2020.06.004 > DOI: 10.1016/j.jctb.2020.06.004.
    • APA

      Han, J., Jenssen, M., Kohayakawa, Y., Mota, G. O., & Roberts, B. (2020). The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory, Series B, 145, 359-375. doi:10.1016/j.jctb.2020.06.004
    • NLM

      Han J, Jenssen M, Kohayakawa Y, Mota GO, Roberts B. The multicolour size-Ramsey number of powers of paths [Internet]. Journal of Combinatorial Theory, Series B. 2020 ; 145 359-375.Available from: https://doi.org/10.1016/j.jctb.2020.06.004
    • Vancouver

      Han J, Jenssen M, Kohayakawa Y, Mota GO, Roberts B. The multicolour size-Ramsey number of powers of paths [Internet]. Journal of Combinatorial Theory, Series B. 2020 ; 145 359-375.Available from: https://doi.org/10.1016/j.jctb.2020.06.004
  • Source: Journal of Combinatorial Optimization. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      GÓMEZ, Renzo; WAKABAYASHI, Yoshiko. Nontrivial path covers of graphs: existence, minimization and maximization. Journal of Combinatorial Optimization, New York, Springer, v. 39, n. 2, p. 437-456, 2020. Disponível em: < https://doi.org/10.1007/s10878-019-00488-w > DOI: 10.1007/s10878-019-00488-w.
    • APA

      Gómez, R., & Wakabayashi, Y. (2020). Nontrivial path covers of graphs: existence, minimization and maximization. Journal of Combinatorial Optimization, 39( 2), 437-456. doi:10.1007/s10878-019-00488-w
    • NLM

      Gómez R, Wakabayashi Y. Nontrivial path covers of graphs: existence, minimization and maximization [Internet]. Journal of Combinatorial Optimization. 2020 ; 39( 2): 437-456.Available from: https://doi.org/10.1007/s10878-019-00488-w
    • Vancouver

      Gómez R, Wakabayashi Y. Nontrivial path covers of graphs: existence, minimization and maximization [Internet]. Journal of Combinatorial Optimization. 2020 ; 39( 2): 437-456.Available from: https://doi.org/10.1007/s10878-019-00488-w
  • Source: Advances in Mathematics. Unidade: IME

    Subjects: ESPAÇOS L^P, ESPAÇOS DE BANACH, TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERENCZI, Valentin; LOPEZ-ABAD, Jorge; MBOMBO, ‪Brice Rodrigue; TODORCEVIC, Stevo. Amalgamation and Ramsey properties of Lp spaces. Advances in Mathematics, New York, Elsevier, v. 369, 2020. Disponível em: < https://doi.org/10.1016/j.aim.2020.107190 > DOI: 10.1016/j.aim.2020.107190.
    • APA

      Ferenczi, V., Lopez-Abad, J., Mbombo, ‪B. R., & Todorcevic, S. (2020). Amalgamation and Ramsey properties of Lp spaces. Advances in Mathematics, 369. doi:10.1016/j.aim.2020.107190
    • NLM

      Ferenczi V, Lopez-Abad J, Mbombo ‪BR, Todorcevic S. Amalgamation and Ramsey properties of Lp spaces [Internet]. Advances in Mathematics. 2020 ; 369Available from: https://doi.org/10.1016/j.aim.2020.107190
    • Vancouver

      Ferenczi V, Lopez-Abad J, Mbombo ‪BR, Todorcevic S. Amalgamation and Ramsey properties of Lp spaces [Internet]. Advances in Mathematics. 2020 ; 369Available from: https://doi.org/10.1016/j.aim.2020.107190
  • Source: Combinatorics, Probability and Computing. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, PROGRAMAÇÃO MATEMÁTICA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      HAN, Jie; KOHAYAKAWA, Yoshiharu; PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability and Computing, Cambridge, Cambridge University Press, 2020. Disponível em: < https://doi.org/10.1017/S0963548320000577 > DOI: 10.1017/S0963548320000577.
    • APA

      Han, J., Kohayakawa, Y., & Person, Y. (2020). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability and Computing. doi:10.1017/S0963548320000577
    • NLM

      Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability and Computing. 2020 ;Available from: https://doi.org/10.1017/S0963548320000577
    • Vancouver

      Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability and Computing. 2020 ;Available from: https://doi.org/10.1017/S0963548320000577
  • Source: Discrete Mathematics. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CERIOLI, Márcia R; FERNANDES, Cristina Gomes; GÓMEZ, Renzo; GUTIÉRREZ ALVA, Juan Gabriel; LIMA, Paloma T. Transversals of longest paths. Discrete Mathematics, Amsterdam, Elsevier, v. 343, n. 3, 2020. Disponível em: < https://doi.org/10.1016/j.disc.2019.111717 > DOI: 10.1016/j.disc.2019.111717.
    • APA

      Cerioli, M. R., Fernandes, C. G., Gómez, R., Gutiérrez Alva, J. G., & Lima, P. T. (2020). Transversals of longest paths. Discrete Mathematics, 343( 3). doi:10.1016/j.disc.2019.111717
    • NLM

      Cerioli MR, Fernandes CG, Gómez R, Gutiérrez Alva JG, Lima PT. Transversals of longest paths [Internet]. Discrete Mathematics. 2020 ; 343( 3):Available from: https://doi.org/10.1016/j.disc.2019.111717
    • Vancouver

      Cerioli MR, Fernandes CG, Gómez R, Gutiérrez Alva JG, Lima PT. Transversals of longest paths [Internet]. Discrete Mathematics. 2020 ; 343( 3):Available from: https://doi.org/10.1016/j.disc.2019.111717
  • Source: Information. Unidade: ICMC

    Subjects: PROCESSAMENTO DE LINGUAGEM NATURAL, TRATAMENTO AUTOMÁTICO DE TEXTOS E DISCURSOS, TEORIA DOS GRAFOS, SEMÂNTICA, PORTUGUÊS DO BRASIL

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ANCHIETA, Rafael Torres; SOUSA, Rogério Figueredo de; PARDO, Thiago Alexandre Salgueiro. Modeling the paraphrase detection task over a heterogeneous graph network with data augmentation. Information, Basel, MDPI, v. 11, n. 9, p. Se 2020, 2020. Disponível em: < https://doi.org/10.3390/info11090422 > DOI: 10.3390/info11090422.
    • APA

      Anchieta, R. T., Sousa, R. F. de, & Pardo, T. A. S. (2020). Modeling the paraphrase detection task over a heterogeneous graph network with data augmentation. Information, 11( 9), Se 2020. doi:10.3390/info11090422
    • NLM

      Anchieta RT, Sousa RF de, Pardo TAS. Modeling the paraphrase detection task over a heterogeneous graph network with data augmentation [Internet]. Information. 2020 ; 11( 9): Se 2020.Available from: https://doi.org/10.3390/info11090422
    • Vancouver

      Anchieta RT, Sousa RF de, Pardo TAS. Modeling the paraphrase detection task over a heterogeneous graph network with data augmentation [Internet]. Information. 2020 ; 11( 9): Se 2020.Available from: https://doi.org/10.3390/info11090422
  • Source: LATIN 2020 : theoretical informatics. Conference titles: Latin American Symposium - LATIN. Unidade: IME

    Subjects: TEORIA DA COMPUTAÇÃO, COMBINATÓRIA, TEORIA DOS GRAFOS

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu; MIYAZAWA, Flavio Keidi. We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics[S.l: s.n.], 2020.
    • APA

      Kohayakawa, Y., & Miyazawa, F. K. (2020). We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. Cham: Springer.
    • NLM

      Kohayakawa Y, Miyazawa FK. We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. 2020 ;
    • Vancouver

      Kohayakawa Y, Miyazawa FK. We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. 2020 ;
  • Source: Proceeding Series of the Brazilian Society of Computational and Applied Mathematics. Conference titles: Congresso Nacional de Matemática Aplicada e Computacional - CNMAC. Unidade: ICMC

    Subjects: TEORIA DOS GRAFOS, AMOSTRAGEM EXPERIMENTAL, ALGORITMOS ÚTEIS E ESPECÍFICOS

    Versão PublicadaAcesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      NHASSENGO, Evaristo Calisto; CUMINATO, José Alberto; NONATO, Luis Gustavo. Processamento de sinal em grafos: teoria de amostragem e sua aplicação no aprendizado semi-supervisionado. Proceeding Series of the Brazilian Society of Computational and Applied Mathematics[S.l: s.n.], 2020.Disponível em: .
    • APA

      Nhassengo, E. C., Cuminato, J. A., & Nonato, L. G. (2020). Processamento de sinal em grafos: teoria de amostragem e sua aplicação no aprendizado semi-supervisionado. Proceeding Series of the Brazilian Society of Computational and Applied Mathematics. São Carlos: SBMAC. Recuperado de https://proceedings.sbmac.org.br/sbmac/article/view/2914
    • NLM

      Nhassengo EC, Cuminato JA, Nonato LG. Processamento de sinal em grafos: teoria de amostragem e sua aplicação no aprendizado semi-supervisionado [Internet]. Proceeding Series of the Brazilian Society of Computational and Applied Mathematics. 2020 ; 7( 1): 010253-1-010253-2.Available from: https://proceedings.sbmac.org.br/sbmac/article/view/2914
    • Vancouver

      Nhassengo EC, Cuminato JA, Nonato LG. Processamento de sinal em grafos: teoria de amostragem e sua aplicação no aprendizado semi-supervisionado [Internet]. Proceeding Series of the Brazilian Society of Computational and Applied Mathematics. 2020 ; 7( 1): 010253-1-010253-2.Available from: https://proceedings.sbmac.org.br/sbmac/article/view/2914
  • Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      STAGNI, Henrique; KOHAYAKAWA, Yoshiharu. Property testing and parameter estimation. 2020.Universidade de São Paulo, São Paulo, 2020. Disponível em: < https://www.teses.usp.br/teses/disponiveis/45/45134/tde-11022021-194125/ >.
    • APA

      Stagni, H., & Kohayakawa, Y. (2020). Property testing and parameter estimation. Universidade de São Paulo, São Paulo. Recuperado de https://www.teses.usp.br/teses/disponiveis/45/45134/tde-11022021-194125/
    • NLM

      Stagni H, Kohayakawa Y. Property testing and parameter estimation [Internet]. 2020 ;Available from: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-11022021-194125/
    • Vancouver

      Stagni H, Kohayakawa Y. Property testing and parameter estimation [Internet]. 2020 ;Available from: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-11022021-194125/
  • Source: The Journal of Supercomputing. Unidade: EACH

    Subjects: TEORIA DOS GRAFOS, BENCHMARKS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      DENG, Yuefan; GUO, Meng; RAMOS, Alexandre Ferreira; et al. Optimal low-latency network topologies for cluster performance enhancement. The Journal of Supercomputing, New York, v. 76, n. 12, p. 9558-9584, 2020. Disponível em: < https://doi.org/10.1007/s11227-020-03216-y > DOI: 10.1007/s11227-020-03216-y.
    • APA

      Deng, Y., Guo, M., Ramos, A. F., Huang, X., Xu, Z., & Liu, W. (2020). Optimal low-latency network topologies for cluster performance enhancement. The Journal of Supercomputing, 76( 12), 9558-9584. doi:10.1007/s11227-020-03216-y
    • NLM

      Deng Y, Guo M, Ramos AF, Huang X, Xu Z, Liu W. Optimal low-latency network topologies for cluster performance enhancement [Internet]. The Journal of Supercomputing. 2020 ; 76( 12): 9558-9584.Available from: https://doi.org/10.1007/s11227-020-03216-y
    • Vancouver

      Deng Y, Guo M, Ramos AF, Huang X, Xu Z, Liu W. Optimal low-latency network topologies for cluster performance enhancement [Internet]. The Journal of Supercomputing. 2020 ; 76( 12): 9558-9584.Available from: https://doi.org/10.1007/s11227-020-03216-y
  • Source: Combinatorics, Probability and Computing. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, ALGORITMOS PARA PROCESSAMENTO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      HOPPEN, Carlos; KOHAYAKAWA, Yoshiharu; LANG, Richard; LEFMANN, Hanno; STAGNI, Henrique. Estimating parameters associated with monotone properties. Combinatorics, Probability and Computing, Cambridge, Cambridge University Press (CUP), v. 29, n. 4, p. 616-632, 2020. Disponível em: < https://doi.org/10.1017/S0963548320000048 > DOI: 10.1017/S0963548320000048.
    • APA

      Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2020). Estimating parameters associated with monotone properties. Combinatorics, Probability and Computing, 29( 4), 616-632. doi:10.1017/S0963548320000048
    • NLM

      Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Combinatorics, Probability and Computing. 2020 ; 29( 4): 616-632.Available from: https://doi.org/10.1017/S0963548320000048
    • Vancouver

      Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Combinatorics, Probability and Computing. 2020 ; 29( 4): 616-632.Available from: https://doi.org/10.1017/S0963548320000048
  • Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics[S.l: s.n.], 2020.Disponível em: DOI: 10.1016/j.dam.2019.08.002.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2020). Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. doi:10.1016/j.dam.2019.08.002
    • NLM

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.Available from: http://dx.doi.org/10.1016/j.dam.2019.08.002
    • Vancouver

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.Available from: http://dx.doi.org/10.1016/j.dam.2019.08.002
  • Source: Livro de Resumos. Conference titles: Semana Integrada do Instituto de Física de São Carlos - SIFSC. Unidade: IFSC

    Subjects: TEORIA DOS GRAFOS, EQUAÇÃO DE SCHRODINGER, TOPOLOGIA EM COMPUTAÇÃO

    Acesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      DRINKO, Alexandre; PINTO, Diogo de Oliveira Soares. Espalhamento em grafos quânticos. Anais.. São Carlos: Instituto de Física de São Carlos - IFSC, 2020.Disponível em: .
    • APA

      Drinko, A., & Pinto, D. de O. S. (2020). Espalhamento em grafos quânticos. In Livro de Resumos. São Carlos: Instituto de Física de São Carlos - IFSC. Recuperado de https://drive.google.com/file/d/1zSpq9v0UajXDmQq5rhvZXa6H1S1icuwc/view
    • NLM

      Drinko A, Pinto D de OS. Espalhamento em grafos quânticos [Internet]. Livro de Resumos. 2020 ;Available from: https://drive.google.com/file/d/1zSpq9v0UajXDmQq5rhvZXa6H1S1icuwc/view
    • Vancouver

      Drinko A, Pinto D de OS. Espalhamento em grafos quânticos [Internet]. Livro de Resumos. 2020 ;Available from: https://drive.google.com/file/d/1zSpq9v0UajXDmQq5rhvZXa6H1S1icuwc/view

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