Minimum budget for misinformation blocking in online social networks
From MaRDI portal
Publication:2279752
Recommendations
- Maximizing misinformation restriction within time and budget constraints
- Minimum budget for misinformation detection in online social networks with provable guarantees
- Community-based rumor blocking maximization in social networks: algorithms and analysis
- Minimizing the Spread of Rumor Within Budget Constraint in Online Network
- Community-based rumor blocking maximization in social networks
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 1931795 (Why is no real title available?)
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Complexity of finding dense subgraphs
- Maximizing misinformation restriction within time and budget constraints
- The Complexity of Enumeration and Reliability Problems
Cited in
(10)- Contrasting the spread of misinformation in online social networks
- Community-based rumor blocking maximization in social networks
- Minimizing the Spread of Rumor Within Budget Constraint in Online Network
- Minimum budget for misinformation detection in online social networks with provable guarantees
- A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities
- Optimal containment of misinformation in social media: a scenario-based approach
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- Community-based rumor blocking maximization in social networks: algorithms and analysis
- Maximizing misinformation restriction within time and budget constraints
- Misinformation influence minimization problem based on group disbanded in social networks
This page was built for publication: Minimum budget for misinformation blocking in online social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279752)