.png){kind=icon}
.png){kind=icon}
Return
Satisfactory graph partition, variants, and generalizations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2009.10.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Combinatorial optimization
Complexity theory
Vertex partition
Degree constraints
Approximation algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W