What Makes Equitable Connected Partition Easy

@inproceedings{Enciso2009WhatME,
  title={What Makes Equitable Connected Partition Easy},
  author={Rosa Enciso and Michael R. Fellows and Jiong Guo and Iyad A. Kanj and Frances A. Rosamond and Ondrej Such{\'y}},
  booktitle={IWPEC},
  year={2009}
}
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 treewidth, the pathwidth, the size of a minimum feedback vertex set, the size of a minimum vertex cover, and the maximum number of leaves in a… CONTINUE READING

Similar Papers

Loading similar papers…