A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
2006
Journal of Discrete Algorithms
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by deleting edges from G so that the total weight of each component is at least l and at most u. Such an "almost uniform" partition is called an (l, u)-partition. We deal with three problems to find an (l, u)-partition of a given graph; the minimum partition problem is to find an (l, u)-partition with the minimum number of
doi:10.1016/j.jda.2005.01.005
fatcat:oulsy2g5ofd67gv7ivjnktnjo4