Given a social network graph, our objective is to find the top –k influential nodes such that if these k nodes are made seeds of information, the information will spread to maximal number of nodes in a certain number of time stamps. We also wish to optimise k so that there is a reasonable trade-off between cost and time.