125 Degree Discount Heuristic [1] General idea: If u has been selected as a seed, then when considering selecting v as a new seed based on its degree,
{"Image DocumentName": "Degree Discount Heuristic[1]", "Image ImageDescription": "General idea: If u has been selected as a seed, then when considering selecting v as a new seed based on its degree, we should not count the edge v->u. Specifically, for a node v with dv neighbors of which tv are selected as seeds, we should discount v\u2019s degree by. 2tv +(dv-tv) tv p. where p=0.1. The general idea of this approach is that if u has been selected as a seed, then when considering selecting v as a new seed based. on its degree, we should not count the edge vu towards its degree. This is referred to as SingleDiscount. More specifically, for a node v with dv neighbors of which tv are selected as seeds already, we should discount v\u2019s degree by. [1] W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD 09, pages , 2009.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}