8 -Free Graphs in Polynomial Time.">8 -Free Graphs in Polynomial Time., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Finding Dominating Induced Matchings in P8 -Free Graphs in ..."

Andreas Brandstädt, Raffaele Mosca (2017)

> Home

Details and statistics

DOI: 10.1007/S00453-016-0150-Y

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BrandstadtM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BrandstadtM17
Andreas Brandstädt, Raffaele Mosca:
Finding Dominating Induced Matchings in P₈ -Free Graphs in Polynomial Time. Algorithmica 77(4): 1283-1302 (2017)

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.