arXiv (All)
open access
Exact Greedy Influence Maximization in Linear Time on Bounded-Treewidth Graphs
Computing influence spread under the Independent Cascade (IC) model is #P-hard, and influence maximization is commonly approached using Monte Carlo or reverse-reachable-set sampling. We study IC diffusion on bounded-treewidth graphs. Using probability distributions over separator reachability rela
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Power and sample size calculations for evaluating spillover effects in networks with non-randomized interventions#627827
- Reduced spread of nodes in spatial network models improves topology associated with increased computational capabilities#156711
- Reduced spread of nodes in spatial network models improves topology associated with increased computational capabilities#152628
- Approximations for the number of maxima and near-maxima in independent data#128384
- Majority Dynamics on Random Graphs With Almost Balanced Initial Settings: The Power of Few#656561
Record · ID 1033742
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive