On the Complexity of Partitioning a Graph Into a Few Connected Subgraphs

Journal of Combinatorial Optimization - Netherlands
doi 10.1007/s10878-013-9642-8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC