Partitioning a weighted tree to subtrees of almost uniform size

Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki

研究成果: Conference contribution

8 被引用数 (Scopus)

抄録

Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are integers such that 0∈ ∈l∈ ∈u. One wishes to partition G into connected components by deleting edges from G so that the total weight of each component is at least l and at most u. Such an "almost uniform" partition is called an (l, u)-partition. We deal with three problems to find an (l, u)-partition of a given graph: the minimum partition problem is to find an (l, u)-partition with the minimum number of components; the maximum partition problem is defined analogously; and the p-partition problem is to find an (l, u)-partition with a given number p of components. All these problems are NP-hard even for series-parallel graphs, but are solvable for paths in linear time and for trees in polynomial time. In this paper, we give polynomial-time algorithms to solve the three problems for trees, which are much simpler and faster than the known algorithms.

本文言語English
ホスト出版物のタイトルAlgorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings
ページ196-207
ページ数12
DOI
出版ステータスPublished - 2008
イベント19th International Symposium on Algorithms and Computation, ISAAC 2008 - Gold Coast, QLD, Australia
継続期間: 2008 12 152008 12 17

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5369 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other19th International Symposium on Algorithms and Computation, ISAAC 2008
国/地域Australia
CityGold Coast, QLD
Period08/12/1508/12/17

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

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

引用スタイル