| Blocking Rumor by Cut | |
| Gai, Ling[1]; Du, Hongwei[2]; Wu, Lidong[3]; Zhu, Junlei[4]; Bu, Yuehua[5] | |
| 刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
 |
| 2018 | |
| 卷号 | 36页码:392-399 |
| 关键词 | NP-hard Sandwich method Monotone |
| ISSN号 | 1382-6905 |
| URL标识 | 查看原文 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2181968 |
| 专题 | 上海大学 |
| 作者单位 | 1.[1]Shanghai Univ, Sch Management, Shanghai, Peoples R China. 2.[2]Harbin Inst Technol, Dept Comp Sci & Technol, Shenzhen Grad Sch, Shenzhen, Peoples R China. 3.[3]Univ Texas Tyler, Dept Comp Sci, Tyler, TX 75799 USA. 4.[4]Jiaxing Univ, Coll Math Phys & Informat Engn, Jiaxing 314001, Peoples R China. 5.[5]Zhejiang Normal Univ, Dept Math, Jinhua 321004, Zhejiang, Peoples R China.,Zhejiang Normal Univ, Xingzhi Coll, Jinhua 321004, Zhejiang, Peoples R China. |
| 推荐引用方式 GB/T 7714 | Gai, Ling[1],Du, Hongwei[2],Wu, Lidong[3],et al. Blocking Rumor by Cut[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2018,36:392-399. |
| APA | Gai, Ling[1],Du, Hongwei[2],Wu, Lidong[3],Zhu, Junlei[4],&Bu, Yuehua[5].(2018).Blocking Rumor by Cut.JOURNAL OF COMBINATORIAL OPTIMIZATION,36,392-399. |
| MLA | Gai, Ling[1],et al."Blocking Rumor by Cut".JOURNAL OF COMBINATORIAL OPTIMIZATION 36(2018):392-399. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论