Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ejor.2009.10.019 | European Journal of Operational Research |
Keywords | Field | DocType |
05C85, 68R10, 05-02 (primary),05C35, 68W25 (secondary) | Graph theory,Partition problem,Approximation algorithm,Discrete mathematics,Mathematical optimization,Combinatorics,Algorithmics,Vertex (geometry),Combinatorial optimization,Frequency partition of a graph,Graph partition,Mathematics | Journal |
Volume | Issue | ISSN |
206 | 2 | 0377-2217 |
Citations | PageRank | References |
11 | 0.69 | 40 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristina Bazgan | 1 | 679 | 62.76 |
| Zsolt Tuza | 2 | 1889 | 262.52 |
| Daniel Vanderpooten | 3 | 1153 | 74.66 |