Pages that link to "Item:Q2495904"
From MaRDI portal
The following pages link to The satisfactory partition problem (Q2495904):
Displayed 13 items.
- Very cost effective bipartitions in graphs (Q322000) (← links)
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities (Q456174) (← links)
- A 2-approximation for the maximum satisfying bisection problem (Q531427) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Min-max communities in graphs: complexity and computational properties (Q899313) (← links)
- Approximation of satisfactory bisection problems (Q931729) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- Internal Partitions of Regular Graphs (Q2825476) (← links)
- New Insight into 2-Community Structures in Graphs with Applications in Social Networks (Q3467849) (← links)
- SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS (Q5408358) (← links)