Satisfactory graph partition, variants, and generalizations
Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel (2010), Satisfactory graph partition, variants, and generalizations, European Journal of Operational Research, 206, 2, p. 271-280. http://dx.doi.org/10.1016/j.ejor.2009.10.019
TypeArticle accepté pour publication ou publié
Nom de la revueEuropean Journal of Operational Research
MétadonnéesAfficher la notice complète
Résumé (EN)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.
Mots-clésDegree constraints; Approximation algorithm; Vertex partition; Combinatorial optimization; Complexity theory
Affichage des éléments liés par titre et auteur.