Pages that link to "Item:Q1603713"
From MaRDI portal
The following pages link to Local majorities, coalitions and monopolies in graphs: A review (Q1603713):
Displaying 37 items.
- Whom to befriend to influence people (Q2292915) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Opinion forming in Erdős-Rényi random graph and expanders (Q2306607) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Local interaction on random graphs (Q2344940) (← links)
- Influence diffusion in social networks under time window constraints (Q2345457) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- An inclusion hierarchy of irreversible dynamos (Q2355698) (← links)
- Simple dynamics for plurality consensus (Q2401681) (← links)
- Dynamic monopolies in two-way bootstrap percolation (Q2416425) (← links)
- Dynamic monopolies and feedback vertex sets in hexagonal grids (Q2429050) (← links)
- Irreversible conversion processes with deadlines (Q2447539) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- Multi-level dynamo and opinion spreading (Q2971065) (← links)
- Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
- Minority Becomes Majority in Social Networks (Q3460778) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
- A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
- Hardness Results for Seeding Complex Contagion with Neighborhoods (Q5050309) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- Opinion Forming in Erdös-Rényi Random Graph and Expanders (Q5090994) (← links)
- (Q5091008) (← links)
- A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
- Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results (Q5501616) (← links)
- Color War: Cellular Automata with Majority-Rule (Q5739013) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- The power of small coalitions under two-tier majority on regular graphs (Q6048435) (← links)
- (Q6159874) (← links)
- The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity (Q6488210) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
- Counting fixed points and pure 2-cycles of tree cellular automata (Q6547960) (← links)
- Radius \(r\) extremal graphs of girth 5 (Q6562417) (← links)
- Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation (Q6563985) (← links)
- Quasi-majority functional voting on expander graphs (Q6641063) (← links)
