Name
Abstract | ||
|---|---|---|
Rumor Blocking, an important optimization problem in social network, has been extensively studied in the literature. Given social network G=(V,E) and rumor seed set A, the goal is asking for k protector seeds that protect the largest expected number of social individuals by truth. However, the source of rumor is always uncertain, rather than being predicted or being known in advance in the real situations, while rumor spreads like wildfire on the Internet. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.tcs.2019.05.044 | Theoretical Computer Science |
Keywords | Field | DocType |
Rumor blocking,Random algorithm,Greedy approach,Martingale | Randomized algorithm,Discrete mathematics,Martingale (probability theory),Combinatorics,Rumor,Submodular set function,Expected value,Approximate solution,Optimization problem,Mathematics | Journal |
Volume | ISSN | Citations |
803 | 0304-3975 | 0 |
PageRank | References | Authors |
0.34 | 10 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qizhi Fang | 1 | 38 | 6.16 |
| Xin Chen | 2 | 0 | 1.01 |
| Q. Q. Nong | 3 | 47 | 6.24 |
| Zongchao Zhang | 4 | 0 | 0.34 |
| Yongchang Cao | 5 | 10 | 1.92 |
| Yan Feng | 6 | 3 | 0.75 |
| Ding-Zhu Du | 7 | 3497 | 283.06 |