Pages that link to "Item:Q409449"
From MaRDI portal
The following pages link to On dynamic monopolies of graphs with general thresholds (Q409449):
Displayed 27 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- A study of monopolies in graphs (Q367095) (← 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)
- Triggering cascades on strongly connected directed graphs (Q500995) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
- Facets of the dynamic monopoly polytope: linear ordering formulation (Q2042076) (← links)
- Target set selection on generalized pancake graphs (Q2195642) (← links)
- A polyhedral study of dynamic monopolies (Q2288851) (← links)
- Whom to befriend to influence people (Q2292915) (← 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)
- Generalized threshold processes on graphs (Q2402258) (← links)
- Dynamic monopolies and feedback vertex sets in hexagonal grids (Q2429050) (← links)
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs (Q2444564) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS (Q2933686) (← links)
- Optimizing Spread of Influence in Social Networks via Partial Incentives (Q3460711) (← links)
- A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks (Q3467846) (← links)
- The <i>k</i>-conversion number of regular graphs (Q4956206) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)