"Parameterized Complexity of Vertex Deletion into Perfect Graph Classes."

Pinar Heggernes et al. (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-22953-4_21

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fct/HeggernesHJKV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/HeggernesHJKV11
Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger:
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251

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.