"Finding Overlapping Clusters in a Highly Connected Graph from a Given ..."

Kittichai Lavangnananda, Muhammad Aslam HemmatQachmas (2020)

> Home

Details and statistics

DOI: 10.1109/BIGDATA50022.2020.9378329

access: closed

type: Conference or Workshop Paper

metadata version: 2021-04-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/bigdataconf/LavangnanandaH20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bigdataconf/LavangnanandaH20
Kittichai Lavangnananda, Muhammad Aslam HemmatQachmas:
Finding Overlapping Clusters in a Highly Connected Graph from a Given Difference Density. IEEE BigData 2020: 4620-4626

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.