Partitioning a graph into minimum gap components

Electronic Notes in Discrete Mathematics（2016）

引用 5|浏览12

暂无评分

摘要

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.

查看译文

关键词

Graph partitioning,computational complexity,approximability

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要