Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Keywords: درخت کروی جزئی; Algorithm; Lower bound; (l,u)(l,u)-partition; Maximum partition problem; Minimum partition problem; Partial k-tree; Series-parallel graph; Upper bound