1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2021
Approximation and parameterized algorithms to find balanced connected partitions of graphs
Phablo F. S. Moura, Matheus J. Ota, Yoshiko Wakabayashi
Partitioning a connected graph into ~vertex-disjoint connected subgraphs of similar (or given) orders is a classical problem that has been intensively investigated since late se…
cs.DM2019★ 1 cited
Integer Programming Approaches to Balanced Connected -Partition
Flávio K. Miyazawa, Phablo F. S. Moura, Matheus J. Ota +1
We address the problem of partitioning a vertex-weighted connected graph into connected subgraphs that have similar weights, for a fixed integer . This problem, known…