Cite
HARVARD Citation
Wang, R. et al. (2019). Fast graph centrality computation via sampling: a case study of influence maximisation over OSNs. International journal of high performance computing and networking. pp. 92-101. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Wang, R. et al. (2019). Fast graph centrality computation via sampling: a case study of influence maximisation over OSNs. International journal of high performance computing and networking. pp. 92-101. [Online].