IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v206y2010i2p271-280.html
   My bibliography  Save this article

Satisfactory graph partition, variants, and generalizations

Author

Listed:
  • Bazgan, Cristina
  • Tuza, Zsolt
  • Vanderpooten, Daniel

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.

Suggested Citation

  • Bazgan, Cristina & Tuza, Zsolt & Vanderpooten, Daniel, 2010. "Satisfactory graph partition, variants, and generalizations," European Journal of Operational Research, Elsevier, vol. 206(2), pages 271-280, October.
    • Handle: RePEc:eee:ejores:v:206:y:2010:i:2:p:271-280
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00787-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gerber, Michael U. & Kobler, Daniel, 2000. "Algorithmic approach to the satisfactory graph partitioning problem," European Journal of Operational Research, Elsevier, vol. 125(2), pages 283-291, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Raka Jovanovic & Tatsushi Nishi & Stefan Voß, 2017. "A heuristic approach for dividing graphs into bi-connected components with a size constraint," Journal of Heuristics, Springer, vol. 23(2), pages 111-136, June.
    2. Ries, Bernard & Zenklusen, Rico, 2011. "A 2-approximation for the maximum satisfying bisection problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 169-175, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ries, Bernard & Zenklusen, Rico, 2011. "A 2-approximation for the maximum satisfying bisection problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 169-175, April.
    2. Heditniemi, S.M. & Laskar, R.C. & Mulder, H.M., 2012. "Quorum Colorings of Graphs," Econometric Institute Research Papers EI 2012-20, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:206:y:2010:i:2:p:271-280. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.