The balanced satisfactory partition problem
type: Item
instance of: scholarly article
title: The balanced satisfactory partition problem
zbMATH Open document ID: 1490.68154
DOI: 10.1007/978-3-030-67731-2_23
author: Ajinkya Gaikwad
author: Soumen Maity
author: Shuvam Kant Tripathi
publication date: 2022-03-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 7497737
zbMATH Keywords: parameterized complexity
zbMATH Keywords: FPT
zbMATH Keywords: W[1]-hardness
zbMATH Keywords: treewidth
zbMATH Keywords: neighbourhood diversity
MaRDI profile type: Publication
full work available at URL: 978-3-030-67731-2 23
OpenAlex ID: W3125301599
cites work: Algorithms and Computation
cites work: Computing and Combinatorics
cites work: Degree-constrained decompositions of graphs: Bounded treewidth and planarity
cites work: The satisfactory partition problem
cites work: Parameterized Algorithms
cites work: Q4820779
cites work: Algorithmic approach to the satisfactory graph partitioning problem
cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: Algorithmic meta-theorems for restrictions of treewidth
cites work: Integer Programming with a Fixed Number of Variables
cites work: Graph minors. III. Planar tree-width
cites work: Q3012402
cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
description: scientific article; zbMATH DE number 7497737