Satisfactory graph partition, variants, and generalizations

Cristina Bazgan, Z. Tuza, Daniel Vanderpooten

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [M. Gerber, D. Kobler, Algorithmic approach to the satisfactory graph partitioning problem, European Journal of Operational Research 125 (2000) 283-291] and studied further by other authors. In this paper we first review some applications and related problems. Then, we survey structural, complexity, and approximation results obtained for Satisfactory Partition and for some of its variants and generalizations. A list of open questions concludes this survey.

Original languageEnglish
Pages (from-to)271-280
Number of pages10
JournalEuropean Journal of Operational Research
Volume206
Issue number2
DOIs
Publication statusPublished - Oct 16 2010

Fingerprint

Graph Partition
Partition
Graph Partitioning
Operations Research
Vertex of a graph
Generalization
Graph
Approximation
Graph in graph theory

Keywords

  • Approximation algorithm
  • Combinatorial optimization
  • Complexity theory
  • Degree constraints
  • Vertex partition

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Modelling and Simulation
  • Information Systems and Management

Cite this

Satisfactory graph partition, variants, and generalizations. / Bazgan, Cristina; Tuza, Z.; Vanderpooten, Daniel.

In: European Journal of Operational Research, Vol. 206, No. 2, 16.10.2010, p. 271-280.

Research output: Contribution to journalArticle

Bazgan, Cristina ; Tuza, Z. ; Vanderpooten, Daniel. / Satisfactory graph partition, variants, and generalizations. In: European Journal of Operational Research. 2010 ; Vol. 206, No. 2. pp. 271-280.
@article{74e5316d6d804eb8860ec083bbc5865e,
title = "Satisfactory graph partition, variants, and generalizations",
abstract = "The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [M. Gerber, D. Kobler, Algorithmic approach to the satisfactory graph partitioning problem, European Journal of Operational Research 125 (2000) 283-291] and studied further by other authors. In this paper we first review some applications and related problems. Then, we survey structural, complexity, and approximation results obtained for Satisfactory Partition and for some of its variants and generalizations. A list of open questions concludes this survey.",
keywords = "Approximation algorithm, Combinatorial optimization, Complexity theory, Degree constraints, Vertex partition",
author = "Cristina Bazgan and Z. Tuza and Daniel Vanderpooten",
year = "2010",
month = "10",
day = "16",
doi = "10.1016/j.ejor.2009.10.019",
language = "English",
volume = "206",
pages = "271--280",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Satisfactory graph partition, variants, and generalizations

AU - Bazgan, Cristina

AU - Tuza, Z.

AU - Vanderpooten, Daniel

PY - 2010/10/16

Y1 - 2010/10/16

N2 - The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [M. Gerber, D. Kobler, Algorithmic approach to the satisfactory graph partitioning problem, European Journal of Operational Research 125 (2000) 283-291] and studied further by other authors. In this paper we first review some applications and related problems. Then, we survey structural, complexity, and approximation results obtained for Satisfactory Partition and for some of its variants and generalizations. A list of open questions concludes this survey.

AB - The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [M. Gerber, D. Kobler, Algorithmic approach to the satisfactory graph partitioning problem, European Journal of Operational Research 125 (2000) 283-291] and studied further by other authors. In this paper we first review some applications and related problems. Then, we survey structural, complexity, and approximation results obtained for Satisfactory Partition and for some of its variants and generalizations. A list of open questions concludes this survey.

KW - Approximation algorithm

KW - Combinatorial optimization

KW - Complexity theory

KW - Degree constraints

KW - Vertex partition

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

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

U2 - 10.1016/j.ejor.2009.10.019

DO - 10.1016/j.ejor.2009.10.019

M3 - Article

AN - SCOPUS:77950459351

VL - 206

SP - 271

EP - 280

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -