##
###
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
[chapter]

Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki

2006
*
Lecture Notes in Computer Science
*

Our *algorithms* for *series*-*parallel* *graphs* can be extended for partial k-*trees*, that is, *graphs* with bounded *tree*-*width*. ...
*The* problem *of* finding such *a* "uniform" partition is NP-hard for *series*-*parallel* *graphs*, and is strongly NP-hard for general *graphs* even for q = 1. ...
Our *algorithms* for *series*-*parallel* *graphs* can be extended for partial k-*trees*, that is, *graphs* with bounded *tree*-*width* [1, 2] . ...

doi:10.1007/11809678_9
fatcat:o7ze5ebvcjhgfiw6xtscumcfqy