New seeding strategies for the influence maximization problem
From MaRDI portal
Cites work
- Automata, Languages and Programming
- Diffusion in Social Networks
- Dividing a Graph into Triconnected Components
- Graph sparsification by effective resistances
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- Maximizing social influence in nearly optimal time
- Network Analysis
- Spectral sparsification of graphs
This page was built for publication: New seeding strategies for the influence maximization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621434)