Pages that link to "Item:Q410735"
From MaRDI portal
The following pages link to Combinatorial model and bounds for target set selection (Q410735):
Displaying 50 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- Complexity of equilibrium in competitive diffusion games on social networks (Q273917) (← links)
- On non-progressive spread of influence through social networks (Q401306) (← links)
- New bounds for contagious sets (Q418891) (← 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)
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) (← links)
- Dynamic monopolies with randomized starting configuration (Q653331) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- Contagious sets in dense graphs (Q1678088) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← 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)
- On reconfigurability of target sets (Q2110378) (← links)
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
- Target set selection on generalized pancake graphs (Q2195642) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- A polyhedral study of dynamic monopolies (Q2288851) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Partial immunization of trees (Q2299985) (← 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)
- Minimal contagious sets in random regular graphs (Q2350108) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- An inclusion hierarchy of irreversible dynamos (Q2355698) (← links)
- Generalized threshold processes on graphs (Q2402258) (← links)
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← 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)
- Vaccinate your trees! (Q2632015) (← links)
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- On giant components and treewidth in the layers model (Q2811162) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS (Q2933686) (← links)
- Optimizing spread dynamics on graphs by message passing (Q3301689) (← links)
- On irreversible spread of influence in edge-weighted graphs (Q3303530) (← links)
