Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.

Takehiro Ito Xiao Zhou Takao Nishizeki Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. 142-154 2006 4 J. Discrete Algorithms 1 http://dx.doi.org/10.1016/j.jda.2005.01.005 db/journals/jda/jda4.html#ItoZN06