ReP USP - Resultado da busca

Artigo de periodico
Balanced connected partitions of graphs: approximation, parameterization and lower bounds (2023)
Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e OTA, Matheus Jun e WAKABAYASHI, Yoshiko. Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, v. 45, n. artigo 127, p. 1-27, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10878-023-01058-x. Acesso em: 23 maio 2024.
APA
Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2023). Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, 45( artigo 127), 1-27. doi:10.1007/s10878-023-01058-x
NLM
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Vancouver
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Artigo de periodico
Leafy spanning k-forests (2022)
Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri ; San Felice, Mário César
Source: Journal of Combinatorial Optimization. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri e SAN FELICE, Mário César. Leafy spanning k-forests. Journal of Combinatorial Optimization, v. 44, n. 2, p. 934-946, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10878-022-00872-z. Acesso em: 23 maio 2024.
APA
Fernandes, C. G., Lintzmayer, C. N., & San Felice, M. C. (2022). Leafy spanning k-forests. Journal of Combinatorial Optimization, 44( 2), 934-946. doi:10.1007/s10878-022-00872-z
NLM
Fernandes CG, Lintzmayer CN, San Felice MC. Leafy spanning k-forests [Internet]. Journal of Combinatorial Optimization. 2022 ; 44( 2): 934-946.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10878-022-00872-z
Vancouver
Fernandes CG, Lintzmayer CN, San Felice MC. Leafy spanning k-forests [Internet]. Journal of Combinatorial Optimization. 2022 ; 44( 2): 934-946.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10878-022-00872-z
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
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: 23 maio 2024.
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 2024 maio 23 ] 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 2024 maio 23 ] 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
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: 23 maio 2024.
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 2024 maio 23 ] 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 2024 maio 23 ] Available from: https://doi.org/10.1007/s10878-017-0128-y

USP Schools

ReP

Filtros

Authors

Funding Agencies