"Efficient maximum clique computation and enumeration over large sparse graphs."

Lijun Chang (2020)

> Home

Details and statistics

DOI: 10.1007/S00778-020-00602-Z

access: closed

type: Journal Article

metadata version: 2021-03-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/vldb/Chang20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vldb/Chang20
Lijun Chang:
Efficient maximum clique computation and enumeration over large sparse graphs. VLDB J. 29(5): 999-1022 (2020)

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.