A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs (Q2839221): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:19, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs |
scientific article |
Statements
A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs (English)
0 references
4 July 2013
0 references
dominating induced matching
0 references
efficient edge dominating set
0 references
polynomial-time algorithm
0 references
