"On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges."

Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-319-03898-8_21

access: closed

type: Conference or Workshop Paper

metadata version: 2017-10-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwpec/LokshtanovMS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/LokshtanovMS13
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. IPEC 2013: 243-254

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.