Pages that link to "Item:Q976309"

The following pages link to Satisfactory graph partition, variants, and generalizations (Q976309):

Displaying 13 items.

• 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)
• Improper C-colorings of graphs (Q629357) (← links)
• Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Aspects of upper defensive alliances (Q2026328) (← links)
• Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
• A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
• Internal Partitions of Regular Graphs (Q2825476) (← links)
• New Insight into 2-Community Structures in Graphs with Applications in Social Networks (Q3467849) (← links)
• Stabilization Time in Weighted Minority Processes (Q5090505) (← links)
• (Dis)assortative partitions on random regular graphs (Q5877003) (← links)
• A note on internal partitions: the 5-regular case and beyond (Q6121923) (← links)