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: 13 nov. 2025.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-xNLM
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 2025 nov. 13 ] Available from: https://doi.org/10.1007/s10878-023-01058-xVancouver
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 2025 nov. 13 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
