"An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs."

George Manoussakis (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.IPEC.2017.27

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/iwpec/Manoussakis17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/Manoussakis17
George Manoussakis:
An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs. IPEC 2017: 27:1-27:8

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.