Partitioning a multi-weighted graph to connected subgraphs of almost uniform size

Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki

研究成果: Article査読

4 被引用数 (Scopus)


Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers l i and ui, 1 ≤ i ≤ q, are given. One wishes to partition G into connected components by deleting edges from G so that the total i-th weights of all vertices in each component is at least li and at most ui for each index i, 1 ≤ i ≤ q. 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. In this paper we show that the problem and many variants can be solved in pseudo-polynomial time for series-parallel graphs and partial k-trees, that is, graphs with bounded tree-width.

ジャーナルIEICE Transactions on Information and Systems
出版ステータスPublished - 2007 2

ASJC Scopus subject areas

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学
  • 人工知能


「Partitioning a multi-weighted graph to connected subgraphs of almost uniform size」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。