On the existence and determination of satisfactory partitions in a graph

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten

Research output: Chapter

11 Citations (Scopus)

Abstract

The SATISFACTORY PARTITION problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi then dVi(v) ≥ s(v), where s(v) ≤ d(v) is a given integer-valued function. This problem was introduced by Gerber and Kobler [EJOR 125 (2000), 283-291] for s = [d/2]. In this paper we study the complexity of this problem for different values of s.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsToshihide Ibaraki, Naoki Katoh, Hirotaka Ono
PublisherSpringer Verlag
Pages444-453
Number of pages10
ISBN (Electronic)9783540206958
Publication statusPublished - jan. 1 2003

Publication series

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

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bazgan, C., Tuza, Z., & Vanderpooten, D. (2003). On the existence and determination of satisfactory partitions in a graph. In T. Ibaraki, N. Katoh, & H. Ono (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 444-453). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2906). Springer Verlag.