"A Fast Exact Algorithm to Enumerate Maximal Pseudo-cliques in Large Sparse ..."

Ahsanur Rahman et al. (2024)

> Home

Details and statistics

DOI: 10.1145/3637528.3672066

access: closed

type: Conference or Workshop Paper

metadata version: 2024-09-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/kdd/RahmanRMC24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kdd/RahmanRMC24
Ahsanur Rahman, Kalyan Roy, Ramiza Maliha, Townim Faisal Chowdhury:
A Fast Exact Algorithm to Enumerate Maximal Pseudo-cliques in Large Sparse Graphs. KDD 2024: 2479-2490

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.