Cite
HARVARD Citation
Mei, G. et al. (2021). An efficient graph clustering algorithm by exploiting k-core decomposition and motifs. Computers & electrical engineering. p. . [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Mei, G. et al. (2021). An efficient graph clustering algorithm by exploiting k-core decomposition and motifs. Computers & electrical engineering. p. . [Online].