Parameterized complexity of satisfactory partition problem
From MaRDI portal
Publication:5918491
DOI10.1016/j.tcs.2022.01.022OpenAlexW4220973357MaRDI QIDQ5918491
Soumen Maity, Ajinkya Gaikwad, Shuvam Kant Tripathi
Publication date: 21 February 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.022
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.
- Alliances in graphs of bounded 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
- Parameterized complexity of satisfactory partition problem
This page was built for publication: Parameterized complexity of satisfactory partition problem
