Contrasting the spread of misinformation in online social networks
From MaRDI portal
Publication:5139596
Recommendations
- Maximizing misinformation restriction within time and budget constraints
- Optimal containment of misinformation in social media: a scenario-based approach
- Minimum budget for misinformation detection in online social networks with provable guarantees
- Minimum budget for misinformation blocking in online social networks
- Community-based rumor blocking maximization in social networks
Cites work
- scientific article; zbMATH DE number 3285076 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- Algorithms – ESA 2005
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- Logit Dynamics with Concurrent Updates for Local Interaction Games
- Optimum branchings
- Rumors in a Network: Who's the Culprit?
- Thek best spanning arborescences of a network
Cited in
(9)- On computing optimal temporal branchings and spanning subgraphs
- Minimum budget for misinformation detection in online social networks with provable guarantees
- On the statistical properties of viral misinformation in online social media
- Optimal containment of misinformation in social media: a scenario-based approach
- Spread of (mis)information in social networks
- Misinformation due to asymmetric information sharing
- Maximizing misinformation restriction within time and budget constraints
- Efficient algorithms for finding diversified top-\(k\) structural hole spanners in social networks
- Misinformation influence minimization problem based on group disbanded in social networks
This page was built for publication: Contrasting the spread of misinformation in online social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139596)
