Menu

Filtros : "Journal of Combinatorial Optimization" "Financiado pela FAPESP" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    Nontrivial path covers of graphs: existence, minimization and maximization (2020)

    Gómez, Renzo ; Wakabayashi, Yoshiko

    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 e WAKABAYASHI, Yoshiko. Nontrivial path covers of graphs: existence, minimization and maximization. Journal of Combinatorial Optimization, v. 39, n. 2, p. 437-456, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10878-019-00488-w. Acesso em: 13 nov. 2025.

    • 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.[citado 2025 nov. 13 ] 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.[citado 2025 nov. 13 ] Available from: https://doi.org/10.1007/s10878-019-00488-w

  • Artigo de periodico

    The k-hop connected dominating set problem: approximation and hardness (2017)

    Coelho, Rafael S; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko

    Source: Journal of Combinatorial Optimization. Unidade: IME

    Subjects: COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO

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

    • ABNT

      COELHO, Rafael S e MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: approximation and hardness. Journal of Combinatorial Optimization, v. 34, n. 4, p. 1060–1083, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10878-017-0128-y. Acesso em: 13 nov. 2025.

    • APA

      Coelho, R. S., Moura, P. F. S., & Wakabayashi, Y. (2017). The k-hop connected dominating set problem: approximation and hardness. Journal of Combinatorial Optimization, 34( 4), 1060–1083. doi:10.1007/s10878-017-0128-y

    • NLM

      Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: approximation and hardness [Internet]. Journal of Combinatorial Optimization. 2017 ; 34( 4): 1060–1083.[citado 2025 nov. 13 ] Available from: https://doi.org/10.1007/s10878-017-0128-y

    • Vancouver

      Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: approximation and hardness [Internet]. Journal of Combinatorial Optimization. 2017 ; 34( 4): 1060–1083.[citado 2025 nov. 13 ] Available from: https://doi.org/10.1007/s10878-017-0128-y
  • 1

1 - 2 (2 records)

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