The balanced satisfactory partition problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5917571 (Why is no real title available?)
- scientific article; zbMATH DE number 2104729 (Why is no real title available?)
- Algorithmic approach to the satisfactory graph partitioning problem
- Algorithmic meta-theorems for restrictions of treewidth
- Algorithms and Computation
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Computing and Combinatorics
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity
- Graph minors. III. Planar tree-width
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- Parameterized algorithms
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- The satisfactory partition problem
Cited in
(11)- A note on the satisfactory partition problem: constant size requirement
- Parameterized complexity of satisfactory partition problem
- Computing and Combinatorics
- The satisfactory partition problem
- A class of balanced allocation problems
- Satisfactory graph partition, variants, and generalizations
- Stable skew partition problem
- scientific article; zbMATH DE number 2104729 (Why is no real title available?)
- The Bipartite Rationing Problem
- Finding \(k\)-community structures in special graph classes
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
This page was built for publication: The balanced satisfactory partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831826)