The satisfactory partition problem
From MaRDI portal
Publication:2495904
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cites work
- Algorithmic approach to the satisfactory graph partitioning problem
- Algorithms and Computation
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1933255 (Why is no real title available?)
- scientific article; zbMATH DE number 944226 (Why is no real title available?)
- scientific article; zbMATH DE number 2104729 (Why is no real title available?)
- NP completeness of finding the chromatic index of regular graphs
- ON DISJOINT CYCLES
- The NP-Completeness of Edge-Coloring
Cited in
(44)- The solution to the partition reconstruction problem
- Partitioning a graph into alliance free sets
- Algorithmic approach to the satisfactory graph partitioning problem
- Structural and algorithmic properties of 2-community structures
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
- Stable skew partition problem
- The Knowlton-Graham partition problem
- A note on the satisfactory partition problem: constant size requirement
- Graphs without a partition into two proportionally dense subgraphs
- Asymptotically almost every \(2r\)-regular graph has an internal partition
- Well-solvable instances for the partition problem
- Degree-constrained 2-partitions of graphs
- Internal partitions of regular graphs
- Very cost effective bipartitions in graphs
- Alliances and Related Domination Parameters
- New insight into 2-community structures in graphs with applications in social networks
- scientific article; zbMATH DE number 1193306 (Why is no real title available?)
- scientific article; zbMATH DE number 1933255 (Why is no real title available?)
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
- scientific article; zbMATH DE number 2104729 (Why is no real title available?)
- Stabilization Time in Weighted Minority Processes
- On locally-balanced 2-partitions of bipartite graphs
- LOCALLY-BALANCED k-PARTITIONS OF GRAPHS
- The Bipartite Rationing Problem
- Algorithms and Computation
- Bounds on cost effective domination numbers
- A 2-approximation for the maximum satisfying bisection problem
- Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets
- Computing and Combinatorics
- Parameterized complexity of satisfactory partition problem
- Parameterized complexity of satisfactory partition problem
- Finding \(k\)-community structures in special graph classes
- A general stabilization bound for influence propagation in graphs
- Finding proportionally dense subgraphs of maximum size in degree-constrained graphs
- Minority sets in graphs
- Proportionally dense subgraphs: parameterized hardness and efficiently solvable cases
- Majority sets in graphs
- Convergence and hardness of strategic Schelling segregation
- The balanced satisfactory partition problem
- The mean-partition problem
- Efficient algorithms for decomposing graphs under degree constraints
- Min-max communities in graphs: complexity and computational properties
- Approximation of satisfactory bisection problems
- Satisfactory graph partition, variants, and generalizations
This page was built for publication: The satisfactory partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495904)
