On time versus size for monotone dynamic monopolies in regular topologies
From MaRDI portal
Publication:1827282
DOI10.1016/S1570-8667(03)00022-4zbMath1074.68045MaRDI QIDQ1827282
Peter Ružička, Alessandro Roncato, Paola Flocchini, Rastislav Královič, Nicola Santoro
Publication date: 6 August 2004
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (36)
Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS ⋮ 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 ⋮ Bounding the open \(k\)-monopoly number of strong product graphs ⋮ Dynamic monopolies and feedback vertex sets in hexagonal grids ⋮ Triggering cascades on undirected connected graphs ⋮ On reversible cascades in scale-free and Erdős-Rényi random graphs ⋮ Spreading of messages in random graphs ⋮ Multi-level dynamo and opinion spreading ⋮ On dynamic monopolies of graphs: the average and strict majority thresholds ⋮ 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 ⋮ Majority rule cellular automata ⋮ Triggering cascades on strongly connected directed graphs ⋮ A computational study of \(f\)-reversible processes on graphs ⋮ Reversible iterative graph processes ⋮ The complexity of flood filling games ⋮ Color War: Cellular Automata with Majority-Rule ⋮ Irreversible conversion of graphs ⋮ Optimal irreversible dynamos in chordal rings ⋮ The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ Fast and frugal targeting with incentives ⋮ Opinion forming in Erdős-Rényi random graph and expanders ⋮ Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results ⋮ On the complexity of reasoning about opinion diffusion under majority dynamics ⋮ Influence diffusion in social networks under time window constraints ⋮ Spread of influence in weighted networks under time and budget constraints ⋮ Influence Diffusion in Social Networks under Time Window Constraints ⋮ On irreversible spread of influence in edge-weighted graphs ⋮ Exact solutions for latency-bounded target set selection problem on some special families of graphs
Cites Work
This page was built for publication: On time versus size for monotone dynamic monopolies in regular topologies
