Paper Abstract and Keywords |
Presentation |
2005-01-28 13:30
Partitioning Graphs of Supply and Demand Takehiro Ito, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
Abstract |
(in Japanese) |
(See Japanese page) |
(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) |
(in English) |
algorithm / demand / maximum partition problem / partial $k$-trees / series-parallel graphs / supply / / |
Reference Info. |
IEICE Tech. Rep., vol. 104, no. 642, COMP2004-66, pp. 47-56, Jan. 2005. |
Paper # |
COMP2004-66 |
Date of Issue |
2005-01-21 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 |
Download PDF |
|
Conference Information |
Committee |
COMP |
Conference Date |
2005-01-28 - 2005-01-28 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Nagoya University |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2005-01-COMP |
Language |
English (Japanese title is available) |
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 |
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Takehiro Ito |
1st Author's Affiliation |
Tohoku University (Tohoku Univ.) |
2nd Author's Name |
Xiao Zhou |
2nd Author's Affiliation |
Tohoku University (Tohoku Univ.) |
3rd Author's Name |
Takao Nishizeki |
3rd Author's Affiliation |
Tohoku University (Tohoku Univ.) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2005-01-28 13:30:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2004-66 |
Volume (vol) |
vol.104 |
Number (no) |
no.642 |
Page |
pp.47-56 |
#Pages |
10 |
Date of Issue |
2005-01-21 (COMP) |
|