Pages that link to "Item:Q2250539"

The following pages link to Parameterized approximability of maximizing the spread of influence in networks (Q2250539):

Displaying 15 items.

• The complexity of finding effectors (Q519899) (← links)
• On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
• Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available (Q831148) (← links)
• Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• On reconfigurability of target sets (Q2110378) (← links)
• Whom to befriend to influence people (Q2292915) (← links)
• Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
• Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
• Evangelism in Social Networks (Q2819494) (← links)
• Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
• A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
• Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
• Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)