"A linear time algorithm for maximal clique enumeration in large sparse graphs."

Ting Yu, Mengchi Liu (2017)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2017.05.005

access: closed

type: Journal Article

metadata version: 2022-08-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/YuL17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/YuL17
Ting Yu, Mengchi Liu:
A linear time algorithm for maximal clique enumeration in large sparse graphs. Inf. Process. Lett. 125: 35-40 (2017)

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.