The following pages link to (Q4415262):
Displaying 10 items.
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
- Alliance free sets in Cartesian product graphs (Q2446344) (← links)
- Minimum monopoly in regular and tree graphs (Q2497525) (← links)
- Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
- Hardness Results for Seeding Complex Contagion with Neighborhoods (Q5050309) (← links)
- Majority vote in social networks (Q6180001) (← links)
- On the complexity of co-secure dominating set problem (Q6195337) (← links)
- Target set in threshold models (Q6621268) (← links)
