On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.03.011 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978626345 / rank | |||
Normal rank |
Revision as of 21:19, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of the dominating induced matching problem in hereditary classes of graphs |
scientific article |
Statements
On the complexity of the dominating induced matching problem in hereditary classes of graphs (English)
0 references
19 April 2011
0 references
dominating induced matching
0 references
efficient edge dominating set
0 references
polynomial-time algorithm
0 references