The following pages link to (Q2941641):
Displayed 50 items.
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- Targeted influential nodes selection in location-aware social networks (Q1723006) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Recommending links through influence maximization (Q1731508) (← links)
- Multipolar robust optimization (Q1731824) (← links)
- Influence minimization in linear threshold networks (Q1737600) (← links)
- Locating the contagion source in networks with partial timestamps (Q1741277) (← links)
- Measuring and moderating opinion polarization in social networks (Q1741348) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- An efficient algorithm for link prediction in temporal uncertain social networks (Q1750628) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- Maximizing misinformation restriction within time and budget constraints (Q1752625) (← links)
- Optimization of stochastic virus detection in contact networks (Q1785322) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- Submodular unsplittable flow on trees (Q1801021) (← links)
- The complexity of influence maximization problem in the deterministic linear threshold model (Q1928515) (← links)
- A note on maximizing the spread of influence in social networks (Q1944068) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- Actively learning to infer social ties (Q1944988) (← links)
- Learning influence from heterogeneous social networks (Q1945005) (← links)
- The firefighter problem with more than one firefighter on trees (Q1949095) (← links)
- PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
- Containment of rumor spread by selecting immune nodes in social networks (Q1981274) (← links)
- Dynamic epistemic logics of diffusion and prediction in social networks (Q2001364) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- TIFIM: a two-stage iterative framework for influence maximization in social networks (Q2011109) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- On strict submodularity of social influence (Q2025076) (← links)
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
- Discount allocation for cost minimization in online social networks (Q2025108) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- Inequity aversion pricing over social networks: approximation algorithms and hardness results (Q2031049) (← links)
- Community-based rumor blocking maximization in social networks (Q2039646) (← links)
- Facets of the dynamic monopoly polytope: linear ordering formulation (Q2042076) (← links)
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- Maximizing positive influence in competitive social networks: a trust-based solution (Q2055555) (← links)
- Attribute based diversification of seeds for targeted influence maximization (Q2055595) (← links)
- Blocking adversarial influence in social networks (Q2056948) (← links)
- Large deviations for subcritical bootstrap percolation on the Erdős-Rényi graph (Q2060004) (← links)
- Pareto optimization for subset selection with dynamic cost constraints (Q2060721) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
- Some bounds for the \(Z\)-eigenpair of nonnegative tensors (Q2068054) (← links)
- On the influence maximization problem and the percolation phase transition (Q2068505) (← links)
- Bounding the inefficiency of compromise in opinion formation (Q2072107) (← links)
- Estimating user influence ranking in independent cascade model (Q2072292) (← links)
- Adaptive rewiring of random neural networks generates convergent-divergent units (Q2074169) (← links)