Blocking rumor by cut
From MaRDI portal
Publication:721923
DOI10.1007/s10878-018-0304-8zbMath1402.90195OpenAlexW2802443078WikidataQ129867345 ScholiaQ129867345MaRDI QIDQ721923
Junlei Zhu, Lidong Wu, Ling Gai, Yuehua Bu, Hongwei David Du
Publication date: 20 July 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0304-8
Cites Work
- Centralized and decentralized rumor blocking problems
- Precautionary rumor containment via trustworthy people in social networks
- Maximizing Non-monotone Submodular Functions
- Non-monotone submodular maximization under matroid and knapsack constraints
- A Unified Continuous Greedy Algorithm for Submodular Maximization
This page was built for publication: Blocking rumor by cut