Dominating induced matchings for \(P _{7}\)-free graphs in linear time (Q3104604)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dominating induced matchings for P _7-free graphs in linear time |
scientific article; zbMATH DE number 5988634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dominating induced matchings for \(P _{7}\)-free graphs in linear time |
scientific article; zbMATH DE number 5988634 |
Statements
Dominating Induced Matchings for P 7-free Graphs in Linear Time (English)
0 references
16 December 2011
0 references
dominating induced matching
0 references
efficient edge domination
0 references
\(P _{7}\)-free graphs
0 references
linear-time algorithm
0 references
robust algorithm
0 references
0.9971408247947692
0 references
0.9377739429473876
0 references
0.9351109266281128
0 references
0.8971590995788574
0 references
0.8934300541877747
0 references
