"Lower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover."

Michal Pilipczuk (2016)

> Home

Details and statistics

DOI: 10.1007/978-1-4939-2864-4_777

access: closed

type: Reference Work

metadata version: 2017-07-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - reference/algo/Pilipczuk16c
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/reference/algo/Pilipczuk16c
Michal Pilipczuk:
Lower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover. Encyclopedia of Algorithms 2016: 1159-1162

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.