On time versus size for monotone dynamic monopolies in regular topologies
DOI10.1016/S1570-8667(03)00022-4zbMATH Open1074.68045MaRDI QIDQ1827282FDOQ1827282
Authors: P. Flocchini, Rastislav Královič, Peter Ružička, Alessandro Roncato, N. Santoro 
Publication date: 6 August 2004
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Games involving graphs (91A43) Distributed systems (68M14)
Cites Work
Cited In (44)
- On non-progressive spread of influence through social networks
- Exact solutions for latency-bounded target set selection problem on some special families of graphs
- Combinatorial model and bounds for target set selection
- On dynamic monopolies of graphs with general thresholds
- Triggering cascades on undirected connected graphs
- On dynamic monopolies of graphs: the average and strict majority thresholds
- Spread of influence in weighted networks under time and budget constraints
- On dynamic monopolies of graphs with probabilistic thresholds
- Optimal irreversible dynamos in chordal rings
- Irreversible conversion processes with deadlines
- Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
- The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity
- Majority rule cellular automata
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- On reversible cascades in scale-free and Erdős-Rényi random graphs
- Dynamic monopolies in tori.
- Irreversible conversion of graphs
- A computational study of \(f\)-reversible processes on graphs
- On irreversible spread of influence in edge-weighted graphs
- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
- Opinion forming in Erdős-Rényi random graph and expanders
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs
- Dynamic monopolies of constant size
- Bounding the number of tolerable faults in majority-based systems
- Influence diffusion in social networks under time window constraints
- Multi-level dynamo and opinion spreading
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- Reversible iterative graph processes
- The complexity of flood filling games
- Influence Diffusion in Social Networks under Time Window Constraints
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- Color War: Cellular Automata with Majority-Rule
- Optimizing Spread of Influence in Social Networks via Partial Incentives
- Bounding the open \(k\)-monopoly number of strong product graphs
- On the complexity of reasoning about opinion diffusion under majority dynamics
- Title not available (Why is that?)
- Fast and frugal targeting with incentives
- Triggering cascades on strongly connected directed graphs
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
- A study of monopolies in graphs
- Spreading of messages in random graphs
- Latency-bounded target set selection in social networks
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
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)
