| Presentation | 2005-01-28 Partitioning Graphs of Supply and Demand Takehiro ITO, Xiao ZHOU, Takao NISHIZEKI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive "power" from at most one supply vertex. One thus wishes to partition G into connected components by deleting edges from G so that each component C has exactly one supply vertex whose supply is no less than the sum of demands of all demand vertices in C. If G has no such partition, one wishes to partition G into connected components so that each component C either has no supply vertex or has exactly one supply vertex whose supply is no less than the sum of demands in C, and wishes to maximize the sum of demands in all components with supply vertices. We deal with such a maximization problem, which is NP-hard even for trees and strong NP-hard for general graphs. In this paper, we show that the problem can be solved in pseudo-polynomial time for series-parallel graphs and partial k-trees, that is, graphs with bounded tree-width. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | algorithm / demand / maximum partition problem / partial k-trees / series-parallel graphs / supply |
| Paper # | COMP2004-66 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2005/1/21(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Partitioning Graphs of Supply and Demand |
| Sub Title (in English) | |
| Keyword(1) | algorithm |
| Keyword(2) | demand |
| Keyword(3) | maximum partition problem |
| Keyword(4) | partial k-trees |
| Keyword(5) | series-parallel graphs |
| Keyword(6) | supply |
| 1st Author's Name | Takehiro ITO |
| 1st Author's Affiliation | Graduate School of Information Sciences, Tohoku University() |
| 2nd Author's Name | Xiao ZHOU |
| 2nd Author's Affiliation | Graduate School of Information Sciences, Tohoku University |
| 3rd Author's Name | Takao NISHIZEKI |
| 3rd Author's Affiliation | Graduate School of Information Sciences, Tohoku University |
| Date | 2005-01-28 |
| Paper # | COMP2004-66 |
| Volume (vol) | vol.104 |
| Number (no) | 642 |
| Page | pp.pp.- |
| #Pages | 10 |
| Date of Issue | |