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

Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference 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 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.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings
PublisherSpringer Verlag
Pages63-72
Number of pages10
ISBN (Print)3540369252, 9783540369257
DOIs
Publication statusPublished - 2006
Event12th Annual International Conference on Computing and Combinatorics, COCOON 2006 - Taipei, Taiwan, Province of China
Duration: 2006 Aug 152006 Aug 18

Publication series

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

Other

Other12th Annual International Conference on Computing and Combinatorics, COCOON 2006
CountryTaiwan, Province of China
CityTaipei
Period06/8/1506/8/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Partitioning a multi-weighted graph to connected subgraphs of almost uniform size'. Together they form a unique fingerprint.

Cite this