"Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n."

Marcin Pilipczuk, Michal Pilipczuk (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-33293-7_3

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwpec/PilipczukP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/PilipczukP12
Marcin Pilipczuk, Michal Pilipczuk:
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. IPEC 2012: 3-12

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.