Menu

Filtros : "ALGORITMOS E ESTRUTURAS DE DADOS" "Universidade Federal do ABC (UFABC)" Removido: "FCFRP-601" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    How heavy independent sets help to find arborescences with many leaves in DAGs (2023)

    Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri

    Source: Journal of Computer and System Sciences. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS, ALGORITMOS E ESTRUTURAS DE DADOS

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

    • ABNT

      FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. How heavy independent sets help to find arborescences with many leaves in DAGs. Journal of Computer and System Sciences, v. 135, p. 158-174, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.jcss.2023.02.006. Acesso em: 23 ago. 2024.

    • APA

      Fernandes, C. G., & Lintzmayer, C. N. (2023). How heavy independent sets help to find arborescences with many leaves in DAGs. Journal of Computer and System Sciences, 135, 158-174. doi:10.1016/j.jcss.2023.02.006

    • NLM

      Fernandes CG, Lintzmayer CN. How heavy independent sets help to find arborescences with many leaves in DAGs [Internet]. Journal of Computer and System Sciences. 2023 ; 135 158-174.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006

    • Vancouver

      Fernandes CG, Lintzmayer CN. How heavy independent sets help to find arborescences with many leaves in DAGs [Internet]. Journal of Computer and System Sciences. 2023 ; 135 158-174.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006

  • Artigo de periodico

    Data structures for direct spanning tree representations in mutation-based evolutionary algorithms (2020)

    Barbosa, Marco A. L; Delbem, Alexandre Cláudio Botazzo ; Bueno, Letícia Rodrigues

    Source: IEEE Transactions on Evolutionary Computation. Unidade: ICMC

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

    • ABNT

      BARBOSA, Marco A. L e DELBEM, Alexandre Cláudio Botazzo e BUENO, Letícia Rodrigues. Data structures for direct spanning tree representations in mutation-based evolutionary algorithms. IEEE Transactions on Evolutionary Computation, v. 24, n. 3, p. 467-478, 2020Tradução . . Disponível em: https://doi.org/10.1109/TEVC.2019.2928991. Acesso em: 23 ago. 2024.

    • APA

      Barbosa, M. A. L., Delbem, A. C. B., & Bueno, L. R. (2020). Data structures for direct spanning tree representations in mutation-based evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 24( 3), 467-478. doi:10.1109/TEVC.2019.2928991

    • NLM

      Barbosa MAL, Delbem ACB, Bueno LR. Data structures for direct spanning tree representations in mutation-based evolutionary algorithms [Internet]. IEEE Transactions on Evolutionary Computation. 2020 ; 24( 3): 467-478.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1109/TEVC.2019.2928991

    • Vancouver

      Barbosa MAL, Delbem ACB, Bueno LR. Data structures for direct spanning tree representations in mutation-based evolutionary algorithms [Internet]. IEEE Transactions on Evolutionary Computation. 2020 ; 24( 3): 467-478.[citado 2024 ago. 23 ] Available from: https://doi.org/10.1109/TEVC.2019.2928991
  • 1

1 - 2 (2 records)

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