"A Polynomial-time Algorithm for the Dominating Induced Matching Problem in ..."

Nicholas Korpelainen (2009)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2009.02.018

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/Korpelainen09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/Korpelainen09
Nicholas Korpelainen:
A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs. Electron. Notes Discret. Math. 32: 133-140 (2009)

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.