On time versus size for monotone dynamic monopolies in regular topologies
From MaRDI portal
(Redirected from Publication:1827282)
Recommendations
Cites work
Cited in
(48)- Size bounds for dynamic monopolies
- Dynamic monopolies in tori.
- Bounding the open \(k\)-monopoly number of strong product graphs
- A computational study of \(f\)-reversible processes on graphs
- Dynamic monopolies of constant size
- Triggering cascades on undirected connected graphs
- On reversible cascades in scale-free and Erdős-Rényi random graphs
- The t-latency bounded strong target set selection problem in some kinds of special family of graphs
- Majority rule cellular automata
- Fast and frugal targeting with incentives
- Opinion forming in Erdős-Rényi random graph and expanders
- Influence diffusion in social networks under time window constraints
- Spread of influence in weighted networks under time and budget constraints
- An inclusion hierarchy of irreversible dynamos
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- Irreversible conversion processes with deadlines
- Latency-bounded target set selection in social networks
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- Exact solutions for latency-bounded target set selection problem on some special families of graphs
- Influence Diffusion in Social Networks under Time Window Constraints
- On dynamic monopolies of graphs with probabilistic thresholds
- Multi-level dynamo and opinion spreading
- On irreversible spread of influence in edge-weighted graphs
- Optimizing spread of influence in social networks via partial incentives
- Bounding the number of tolerable faults in majority-based systems
- A study of monopolies in graphs
- On non-progressive spread of influence through social networks
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
- On dynamic monopolies of graphs: the average and strict majority thresholds
- scientific article; zbMATH DE number 1420911 (Why is no real title available?)
- Triggering cascades on strongly connected directed graphs
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
- Irreversible conversion of graphs
- Color War: Cellular Automata with Majority-Rule
- Optimal irreversible dynamos in chordal rings
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
- Spreading of messages in random graphs
- The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity
- Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
- More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives more algorithmic results for problems of spread of influence
- Reversible iterative graph processes
- The complexity of flood filling games
- Parameterized complexity of the f-critical set problem
- On the complexity of reasoning about opinion diffusion under majority dynamics
This page was built for publication: On time versus size for monotone dynamic monopolies in regular topologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827282)
