Pages that link to "Item:Q1811064"
From MaRDI portal
The following pages link to The power of small coalitions in graphs (Q1811064):
Displaying 19 items.
- A study of monopolies in graphs (Q367095) (← links)
- Triggering cascades on strongly connected directed graphs (Q500995) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- Spreading of messages in random graphs (Q633767) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- Spreading messages (Q1029342) (← links)
- Size bounds for dynamic monopolies (Q1270828) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
- An inclusion hierarchy of irreversible dynamos (Q2355698) (← links)
- Generalized threshold processes on graphs (Q2402258) (← links)
- Irreversible conversion processes with deadlines (Q2447539) (← links)
- Multi-level dynamo and opinion spreading (Q2971065) (← links)
- The complexity of open k-monopolies in graphs for negative k (Q5106671) (← links)
- An improved derandomized approximation algorithm for the max-controlled set problem (Q5198931) (← links)
- (Q6159874) (← links)
