Pages that link to "Item:Q1580976"

The following pages link to Algorithmic approach to the satisfactory graph partitioning problem (Q1580976):

Displaying 32 items.

• Very cost effective bipartitions in graphs (Q322000) (← links)
• A 2-approximation for the maximum satisfying bisection problem (Q531427) (← links)
• Convergence and hardness of strategic Schelling segregation (Q776259) (← links)
• The balanced satisfactory partition problem (Q831826) (← 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)
• Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
• A note on the satisfactory partition problem: constant size requirement (Q2094373) (← links)
• Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
• Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
• Degree-constrained 2-partitions of graphs (Q2419120) (← links)
• The satisfactory partition problem (Q2495904) (← links)
• Internal partitions of regular graphs (Q2825476) (← links)
• Alliances and Related Domination Parameters (Q3384109) (← links)
• (Q3807893) (← links)
• Stabilization Time in Weighted Minority Processes (Q5090505) (← links)
• ON LOCALLY-BALANCED 2-PARTITIONS OF BIPARTITE GRAPHS (Q5100156) (← links)
• LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS (Q5100179) (← links)
• Bounds on cost effective domination numbers (Q5236029) (← links)
• SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS (Q5408358) (← links)
• (Dis)assortative partitions on random regular graphs (Q5877003) (← links)
• Parameterized complexity of satisfactory partition problem (Q5918491) (← links)
• Friendly bisections of random graphs (Q6052387) (← links)
• A strong formulation for the graph partition problem (Q6068542) (← links)
• Graph partitions under average degree constraint (Q6187347) (← links)
• Offensive alliances in graphs (Q6201327) (← links)
• Finding \(k\)-community structures in special graph classes (Q6633530) (← links)
• On perfectly friendly bisections of random graphs (Q6634425) (← links)