Learn More

We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions , such that each partition induces a connected subgraph, and the partitions differ in size by at most one. We examine the problem from the parameterized complexity perspective with respect to the number of partitions, the… (More)

- ‹
- 1
- ›