A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs (Q2839221)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6184199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs |
scientific article; zbMATH DE number 6184199 |
Statements
4 July 2013
0 references
dominating induced matching
0 references
efficient edge dominating set
0 references
polynomial-time algorithm
0 references
A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs (English)
0 references
0.8998274803161621
0 references
0.8712339997291565
0 references
0.8556691408157349
0 references
0.8498948216438293
0 references
0.8485006093978882
0 references
