Recommendations
Cited in
(24)- Spreading messages
- Size bounds for dynamic monopolies
- Triggering cascades on undirected connected graphs
- On reversible cascades in scale-free and Erdős-Rényi random graphs
- Approximability of open \(k\)-monopoly problems
- An inclusion hierarchy of irreversible dynamos
- Generalized threshold processes on graphs
- Irreversible conversion processes with deadlines
- Multi-level dynamo and opinion spreading
- A study of monopolies in graphs
- Triggering cascades on strongly connected directed graphs
- Introduction to coalitions in graphs
- The complexity of open \(k\)-monopolies in graphs for negative \(k\)
- An improved derandomized approximation algorithm for the max-controlled set problem
- Immunity against local influence
- Irreversible conversion of graphs
- Self-coalition graphs
- The power of small coalitions under two-tier majority on regular graphs
- Coalition graphs
- Spreading of messages in random graphs
- Reversible iterative graph processes
- On the average minimum size of a manipulating coalition
- Complexity analysis of P₃-convexity problems on bounded-degree and planar graphs
- Near-optimal solutions for the generalized max-controlled set problem
This page was built for publication: The power of small coalitions in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811064)
