Menu

Filtros : "spanning trees" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Trabalho de evento-anais periodico

    The 2-Decomposition Conjecture for a new class of graphs (2021)

    Botler, Fábio Happ ; Jiménez, Andrea; Sambinelli, Maycon ; Wakabayashi, Yoshiko

    Source: Procedia Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. 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

      BOTLER, Fábio Happ et al. The 2-Decomposition Conjecture for a new class of graphs. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2021.11.044. Acesso em: 22 jan. 2026. , 2021

    • APA

      Botler, F. H., Jiménez, A., Sambinelli, M., & Wakabayashi, Y. (2021). The 2-Decomposition Conjecture for a new class of graphs. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2021.11.044

    • NLM

      Botler FH, Jiménez A, Sambinelli M, Wakabayashi Y. The 2-Decomposition Conjecture for a new class of graphs [Internet]. Procedia Computer Science. 2021 ; 195 359-367.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1016/j.procs.2021.11.044

    • Vancouver

      Botler FH, Jiménez A, Sambinelli M, Wakabayashi Y. The 2-Decomposition Conjecture for a new class of graphs [Internet]. Procedia Computer Science. 2021 ; 195 359-367.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1016/j.procs.2021.11.044

  • Artigo de periodico

    Universality for bounded degree spanning trees in randomly perturbed graphs (2019)

    Böttcher, Julia; Han, Jie ; Kohayakawa, Yoshiharu ; Montgomery, Richard ; Parczyk, Olaf ; Person, Yury

    Source: Random Structures & Algorithms. Unidade: IME

    Assunto: GRAFOS ALEATÓRIOS

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

    • ABNT

      BÖTTCHER, Julia et al. Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, v. 55, n. 4, p. 854-864, 2019Tradução . . Disponível em: https://doi.org/10.1002/rsa.20850. Acesso em: 22 jan. 2026.

    • APA

      Böttcher, J., Han, J., Kohayakawa, Y., Montgomery, R., Parczyk, O., & Person, Y. (2019). Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, 55( 4), 854-864. doi:10.1002/rsa.20850

    • NLM

      Böttcher J, Han J, Kohayakawa Y, Montgomery R, Parczyk O, Person Y. Universality for bounded degree spanning trees in randomly perturbed graphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 854-864.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1002/rsa.20850

    • Vancouver

      Böttcher J, Han J, Kohayakawa Y, Montgomery R, Parczyk O, Person Y. Universality for bounded degree spanning trees in randomly perturbed graphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 854-864.[citado 2026 jan. 22 ] Available from: https://doi.org/10.1002/rsa.20850
  • 1

1 - 2 (2 records)

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