For the 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. https://steedaes.shop/product-category/supercharger-pulleys/