default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network."

Nan Du et al. (2006)

> Home

Details and statistics

DOI: 10.1109/ICDMW.2006.17

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/icdm/DuWXWP06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdm/DuWXWP06
Nan Du, Bin Wu, Liutong Xu, Bai Wang, Xin Pei:
A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network. ICDM Workshops 2006: 320-324

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.