Menu

Filtros : "Electronic Notes in Discrete Mathematics" "Chile" Limpar

Filtros

Refine with date range

  • 1

1 - 3 (3 records)

  • Trabalho de evento-anais periodico

    Estimating the distance to a hereditary graph property (2017)

    Hoppen, Carlos; Kohayakawa, Yoshiharu ; Lang, Richard; Lefmann, Hanno; Stagni, Henrique

    Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17. Unidade: IME

    Assunto: MATEMÁTICA DISCRETA

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

    • ABNT

      HOPPEN, Carlos et al. Estimating the distance to a hereditary graph property. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.07.014. Acesso em: 09 nov. 2025. , 2017

    • APA

      Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2017). Estimating the distance to a hereditary graph property. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.07.014

    • NLM

      Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating the distance to a hereditary graph property [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 607-613.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.endm.2017.07.014

    • Vancouver

      Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating the distance to a hereditary graph property [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 607-613.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.endm.2017.07.014

  • Trabalho de evento-anais periodico

    Stability in geodesics for memoryless binary long-lived consensus (2011)

    Fernandes, Cristina Gomes ; Stein, Maya

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: OTIMIZAÇÃO COMBINATÓRIA

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

    • ABNT

      FERNANDES, Cristina Gomes e STEIN, Maya. Stability in geodesics for memoryless binary long-lived consensus. 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.2011.05.060. Acesso em: 09 nov. 2025. , 2011

    • APA

      Fernandes, C. G., & Stein, M. (2011). Stability in geodesics for memoryless binary long-lived consensus. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.05.060

    • NLM

      Fernandes CG, Stein M. Stability in geodesics for memoryless binary long-lived consensus [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 351-356.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.endm.2011.05.060

    • Vancouver

      Fernandes CG, Stein M. Stability in geodesics for memoryless binary long-lived consensus [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 351-356.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.endm.2011.05.060

  • Trabalho de evento-anais periodico

    The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (2010)

    Acuña, V.; Ferreira, Carlos Eduardo ; Freire, A. S.; Moreno, Eduardo

    Source: Electronic Notes in Discrete Mathematics. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      ACUÑA, V. et al. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. 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.2010.05.021. Acesso em: 09 nov. 2025. , 2010

    • APA

      Acuña, V., Ferreira, C. E., Freire, A. S., & Moreno, E. (2010). The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2010.05.021

    • NLM

      Acuña V, Ferreira CE, Freire AS, Moreno E. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 159-166.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.endm.2010.05.021

    • Vancouver

      Acuña V, Ferreira CE, Freire AS, Moreno E. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 159-166.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.endm.2010.05.021
  • 1

1 - 3 (3 records)

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