default search action

combined dblp search
author search
venue search
publication search

ask others

"Listing all maximal cliques in sparse graphs in near-optimal time."

David Eppstein, Maarten Löffler, Darren Strash (2010)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-23

- view
  - electronic edition @ dagstuhl.de (open access)
- export record
  dblp key:
  - conf/dagstuhl/EppsteinLS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/EppsteinLS10
David Eppstein, Maarten Löffler, Darren Strash:
Listing all maximal cliques in sparse graphs in near-optimal time. Exact Complexity of NP-hard Problems 2010

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.