Pages that link to "Item:Q1270828"
From MaRDI portal
The following pages link to Size bounds for dynamic monopolies (Q1270828):
Displaying 50 items.
- Feedback vertex set in hypercubes (Q294845) (← links)
- On non-progressive spread of influence through social networks (Q401306) (← links)
- On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids (Q427907) (← links)
- On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- The predecessor-existence problem for \(k\)-reversible processes (Q476889) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- Spreading of messages in random graphs (Q633767) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- The complexity of flood filling games (Q692938) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion (Q1028139) (← links)
- Spreading messages (Q1029342) (← links)
- Almost exact minimum feedback vertex set in meshes and butterflies (Q1129019) (← links)
- Size bounds for dynamic monopolies (Q1270828) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- On time versus size for monotone dynamic monopolies in regular topologies (Q1827282) (← links)
- Dynamic monopolies of constant size (Q1850560) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- Phase transition of the 2-choices dynamics on core-periphery networks (Q1981807) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- On the spread of influence in graphs (Q2051833) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Majority rule cellular automata (Q2232605) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Opinion forming in Erdős-Rényi random graph and expanders (Q2306607) (← links)
- Majority dynamics and the retention of information (Q2339621) (← links)
- Local interaction on random graphs (Q2344940) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- Dynamic monopolies in two-way bootstrap percolation (Q2416425) (← links)
- Dynamic monopolies and feedback vertex sets in hexagonal grids (Q2429050) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Multi-level dynamo and opinion spreading (Q2971065) (← links)
- A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem (Q4506267) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- Opinion Forming in Erdös-Rényi Random Graph and Expanders (Q5090994) (← links)
- A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree (Q6045404) (← links)
- The power of small coalitions under two-tier majority on regular graphs (Q6048435) (← links)
