Article ID Journal Published Year Pages File Type
5777202 Electronic Notes in Discrete Mathematics 2016 4 Pages PDF
Abstract
We study the computational complexity and approximability for the problem of partitioning a vertex-weighted undirected graph into p connected subgraphs with minimum gap between the largest and the smallest vertex weights.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Partitioning a graph into minimum gap components
Authors
, ,