The balanced satisfactory partition problem

DOI10.1007/978-3-030-67731-2_23zbMath1490.68154OpenAlexW3125301599MaRDI QIDQ831826

Shuvam Kant Tripathi, Soumen Maity, Ajinkya Gaikwad

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_23

zbMATH Keywords

treewidthparameterized complexityFPTW[1-hardness]neighbourhood diversity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

A note on the satisfactory partition problem: constant size requirement

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. III. Planar tree-width
• Algorithmic approach to the satisfactory graph partitioning problem
• Algorithmic meta-theorems for restrictions of treewidth
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
• Degree-constrained decompositions of graphs: Bounded treewidth and planarity
• The satisfactory partition problem
• Integer Programming with a Fixed Number of Variables
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Minkowski's Convex Body Theorem and Integer Programming
• Algorithms and Computation
• Parameterized Algorithms
• Computing and Combinatorics

This page was built for publication: The balanced satisfactory partition problem