Research on social network influence maximization algorithm based on time sequential relationship
For the click here time sequential relationship between nodes in a dynamic social network,social network influence maximization based on time sequential relationship was proved.The problem was to find k nodes on a time sequential social network to maximize the spread of information.Firstly,the propagation probability between nodes was calculated by