TY - JOUR

T1 - Partitioning a weighted graph to connected subgraphs of almost uniform size

AU - Ito, Takehiro

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 2004

Y1 - 2004

N2 - Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish 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 components. The maximum partition problem is defined similarly. The p-partition problem is to find an (l, u)-partition with a fixed number p of components. All these problems are NP-complete or NP-hard even for series-parallel graphs. In this paper we show that both the minimum partition problem and the maximum partition problem can be solved in time O(u4n) and the p-partition problem can be solved in time O(p2u4n) for any series-parallel graph of n vertices. The algorithms can be easily extended for partial k-trees, that is, graphs with bounded tree-width.

AB - Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish 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 components. The maximum partition problem is defined similarly. The p-partition problem is to find an (l, u)-partition with a fixed number p of components. All these problems are NP-complete or NP-hard even for series-parallel graphs. In this paper we show that both the minimum partition problem and the maximum partition problem can be solved in time O(u4n) and the p-partition problem can be solved in time O(p2u4n) for any series-parallel graph of n vertices. The algorithms can be easily extended for partial k-trees, that is, graphs with bounded tree-width.

UR - http://www.scopus.com/inward/record.url?scp=33644607368&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644607368&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-30559-0_31

DO - 10.1007/978-3-540-30559-0_31

M3 - Article

AN - SCOPUS:33644607368

SN - 0302-9743

VL - 3353

SP - 365

EP - 376

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -