Skip to main content
Springer Nature Link
Log in

Parameterized Complexity of Satisfactory Partition Problem

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12577))

  • 758 Accesses

Abstract

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part. The Balanced Satisfactory Partition problem is a variant of the above problem where the two partite sets are required to have the same cardinality. Both problems are known to be NP-complete. This problem was introduced by Gerber and Kobler [European J. Oper. Res. 125 (2000) 283-291] and further studied by other authors, but its parameterized complexity remains open until now. We enhance our understanding of the problem from the viewpoint of parameterized complexity. The three main results of the paper are the following: (1) The Satisfactory Partition problem is polynomial-time solvable for block graphs, (2) The Satisfactory Partition problem and its balanced version can be solved in polynomial time for graphs of bounded clicque-width, and (3) A generalized version of the Satisfactory Partition problem is W[1]-hard when parametrized by treewidth.

S. Maity—The author’s research was supported in part by the Science and Engineering Research Board (SERB), Govt. of India, under Sanction Order No. MTR/2018/001025.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms, 1st edn. Addison-Wesley Longman Publishing Co., Inc., New York (1974)

    MATH  Google Scholar 

  2. Bazgan, C., Tuza, Z., Vanderpooten, D.: On the existence and determination of satisfactory partitions in a graph. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 444–453. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-24587-2_46

    Chapter  MATH  Google Scholar 

  3. Bazgan, C., Tuza, Z., Vanderpooten, D.: Complexity and approximation of satisfactory partition problems. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 829–838. Springer, Heidelberg (2005). https://doi.org/10.1007/11533719_84

    Chapter  MATH  Google Scholar 

  4. Bazgan, C., Tuza, Z., Vanderpooten, D.: Degree-constrained decompositions of graphs: bounded treewidth and planarity. Theoret. Comput. Sci. 355(3), 389–395 (2006)

    Article  MathSciNet  Google Scholar 

  5. Bazgan, C., Tuza, Z., Vanderpooten, D.: The satisfactory partition problem. Discret. Appl. Math. 154(8), 1236–1245 (2006)

    Article  MathSciNet  Google Scholar 

  6. Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-319-21275-3

    Book  MATH  Google Scholar 

  7. Gerber, M., Kobler, D.: Classes of graphs that can be partitioned to satisfy all their vertices. Aust. J. Comb. 29, 201–214 (2004)

    MathSciNet  MATH  Google Scholar 

  8. Gerber, M.U., Kobler, D.: Algorithmic approach to the satisfactory graph partitioning problem. Eur. J. Oper. Res. 125(2), 283–291 (2000)

    Article  MathSciNet  Google Scholar 

  9. Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci. 299(1), 719–734 (2003)

    Article  MathSciNet  Google Scholar 

  10. Kiyomi, M., Otachi, Y.: Alliances in graphs of bounded clique-width. Discret. Appl. Math. 223, 91–97 (2017)

    Article  MathSciNet  Google Scholar 

  11. Szeider, S.: Not so easy problems for tree decomposable graphs. CoRR, abs/1107.1177 (2011)

    Google Scholar 

Download references

Acknowledgments

The first author gratefully acknowledges support from the Ministry of Human Resource Development, Government of India, under Prime Minister’s Research Fellowship Scheme (No. MRF-192002-211).

Author information

Authors and Affiliations

  1. Indian Institute of Science Education and Research, Pune, 411008, India

    Ajinkya Gaikwad, Soumen Maity & Shuvam Kant Tripathi

Authors
  1. Ajinkya Gaikwad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Soumen Maity
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuvam Kant Tripathi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soumen Maity .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Weili Wu

  2. Xiamen University, Xiamen, China

    Zhongnan Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gaikwad, A., Maity, S., Tripathi, S.K. (2020). Parameterized Complexity of Satisfactory Partition Problem. In: Wu, W., Zhang, Z. (eds) Combinatorial Optimization and Applications. COCOA 2020. Lecture Notes in Computer Science(), vol 12577. Springer, Cham. https://doi.org/10.1007/978-3-030-64843-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-64843-5_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-64842-8

  • Online ISBN: 978-3-030-64843-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics