"An efficient graph clustering algorithm by exploiting k-core ..."

Gang Mei et al. (2021)

> Home

Details and statistics

DOI: 10.1016/J.COMPELECENG.2021.107564

access: closed

type: Journal Article

metadata version: 2022-02-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cee/MeiTXP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cee/MeiTXP21
Gang Mei, Jingzhi Tu, Lei Xiao, Francesco Piccialli:
An efficient graph clustering algorithm by exploiting k-core decomposition and motifs. Comput. Electr. Eng. 96(Part): 107564 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.