Efficient recognition of equimatchable graphs (Q2350604)
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: Efficient recognition of equimatchable graphs |
scientific article; zbMATH DE number 6450094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient recognition of equimatchable graphs |
scientific article; zbMATH DE number 6450094 |
Statements
Efficient recognition of equimatchable graphs (English)
0 references
25 June 2015
0 references
graph algorithms
0 references
maximal matching
0 references
edge dominating set
0 references
equimatchable
0 references
0.85740065574646
0 references
0.8480976819992065
0 references
0.8448556065559387
0 references
0.8214761018753052
0 references
