A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs (Q2839221): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graph Classes: A Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank | |||
Normal rank | |||
Latest revision as of 15:16, 6 July 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
