Menu

Filtros : "2017" "Financiado pela FAPESP" "WAKABAYASHI, YOSHIKO" Limpar

Filtros

Refine with date range

  • 1

1 - 3 (3 records)

  • Trabalho de evento-anais periodico

    Strong intractability of generalized convex recoloring problems (2017)

    Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. 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

      MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. Strong intractability of generalized convex recoloring problems. 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.2017.10.017. Acesso em: 07 out. 2025. , 2017

    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2017). Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.017

    • NLM

      Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2025 out. 07 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017

    • Vancouver

      Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2025 out. 07 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017

  • Trabalho de evento-anais periodico

    Decomposing regular graphs with prescribed girth into paths of given length (2017)

    Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko

    Source: European Journal of Combinatorics. Conference titles: Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME

    Assunto: COMBINATÓRIA

    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 et al. Decomposing regular graphs with prescribed girth into paths of given length. European Journal of Combinatorics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.ejc.2017.06.011. Acesso em: 07 out. 2025. , 2017

    • APA

      Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing regular graphs with prescribed girth into paths of given length. European Journal of Combinatorics. Amsterdam: Elsevier. doi:10.1016/j.ejc.2017.06.011

    • NLM

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing regular graphs with prescribed girth into paths of given length [Internet]. European Journal of Combinatorics. 2017 ;66 28-36.[citado 2025 out. 07 ] Available from: https://doi.org/10.1016/j.ejc.2017.06.011

    • Vancouver

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing regular graphs with prescribed girth into paths of given length [Internet]. European Journal of Combinatorics. 2017 ;66 28-36.[citado 2025 out. 07 ] Available from: https://doi.org/10.1016/j.ejc.2017.06.011

  • 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: 07 out. 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 out. 07 ] 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 out. 07 ] Available from: https://doi.org/10.1007/s10878-017-0128-y
  • 1

1 - 3 (3 records)

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