Dominating induced matching in some subclasses of bipartite graphs (Q5919635)
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 matching in some subclasses of bipartite graphs |
scientific article; zbMATH DE number 7115811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dominating induced matching in some subclasses of bipartite graphs |
scientific article; zbMATH DE number 7115811 |
Statements
Dominating induced matching in some subclasses of bipartite graphs (English)
0 references
10 October 2019
0 references
matching
0 references
dominating induced matching
0 references
graph algorithms
0 references
NP-completeness
0 references
polynomial time algorithms
0 references
0.968106210231781
0 references
0.8913680911064148
0 references
0.8810141086578369
0 references
0.8755216598510742
0 references
0.8723956346511841
0 references
