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

Takehiro Ito; Kazuya Goto; Xiao Zhou; Takao Nishizeki

doi:10.1007/11809678_9

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

Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 u_i, 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 l_i and at most u_i 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. Our algorithms for series-parallel graphs can be extended for partial k-trees, that is, graphs with bounded tree-width.

Original language	English
Title of host publication	Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings
Publisher	Springer Verlag
Pages	63-72
Number of pages	10
ISBN (Print)	3540369252, 9783540369257
DOIs	https://doi.org/10.1007/11809678_9
Publication status	Published - 2006
Event	12th Annual International Conference on Computing and Combinatorics, COCOON 2006 - Taipei, Taiwan, Province of China Duration: 2006 Aug 15 → 2006 Aug 18

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4112 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	12th Annual International Conference on Computing and Combinatorics, COCOON 2006
Country/Territory	Taiwan, Province of China
City	Taipei
Period	06/8/15 → 06/8/18

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11809678_9

Cite this

Ito, T., Goto, K., Zhou, X., & Nishizeki, T. (2006). Partitioning a multi-weighted graph to connected subgraphs of almost uniform size. In Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings (pp. 63-72). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4112 LNCS). Springer Verlag. https://doi.org/10.1007/11809678_9

Partitioning a multi-weighted graph to connected subgraphs of almost uniform size. / Ito, Takehiro; Goto, Kazuya; Zhou, Xiao et al.

Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Springer Verlag, 2006. p. 63-72 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4112 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ito, T, Goto, K, Zhou, X & Nishizeki, T 2006, Partitioning a multi-weighted graph to connected subgraphs of almost uniform size. in Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4112 LNCS, Springer Verlag, pp. 63-72, 12th Annual International Conference on Computing and Combinatorics, COCOON 2006, Taipei, Taiwan, Province of China, 06/8/15. https://doi.org/10.1007/11809678_9

Ito T, Goto K, Zhou X, Nishizeki T. Partitioning a multi-weighted graph to connected subgraphs of almost uniform size. In Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Springer Verlag. 2006. p. 63-72. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11809678_9

Ito, Takehiro ; Goto, Kazuya ; Zhou, Xiao et al. / Partitioning a multi-weighted graph to connected subgraphs of almost uniform size. Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Springer Verlag, 2006. pp. 63-72 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fddb02d4241547e082f9c0fd9863213c,

title = "Partitioning a multi-weighted graph to connected subgraphs of almost uniform size",

abstract = "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. Our algorithms for series-parallel graphs can be extended for partial k-trees, that is, graphs with bounded tree-width.",

author = "Takehiro Ito and Kazuya Goto and Xiao Zhou and Takao Nishizeki",

year = "2006",

doi = "10.1007/11809678_9",

language = "English",

isbn = "3540369252",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "63--72",

booktitle = "Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings",

note = "12th Annual International Conference on Computing and Combinatorics, COCOON 2006 ; Conference date: 15-08-2006 Through 18-08-2006",

}

TY - GEN

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

AU - Ito, Takehiro

AU - Goto, Kazuya

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 2006

Y1 - 2006

N2 - 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. Our algorithms for series-parallel graphs can be extended for partial k-trees, that is, graphs with bounded tree-width.

AB - 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. Our algorithms for series-parallel graphs can be extended for partial k-trees, that is, graphs with bounded tree-width.

UR - http://www.scopus.com/inward/record.url?scp=33749573476&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749573476&partnerID=8YFLogxK

U2 - 10.1007/11809678_9

DO - 10.1007/11809678_9

M3 - Conference contribution

AN - SCOPUS:33749573476

SN - 3540369252

SN - 9783540369257

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 63

EP - 72

BT - Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings

PB - Springer Verlag

T2 - 12th Annual International Conference on Computing and Combinatorics, COCOON 2006

Y2 - 15 August 2006 through 18 August 2006

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this