Bounding and approximating minimum maximal matchings in regular graphs (Q2222947)
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: Bounding and approximating minimum maximal matchings in regular graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding and approximating minimum maximal matchings in regular graphs |
scientific article |
Statements
Bounding and approximating minimum maximal matchings in regular graphs (English)
0 references
27 January 2021
0 references
minimum maximal matching
0 references
edge domination
0 references
0 references
0 references
0.8269029259681702
0 references
0.8168352842330933
0 references
0.8157826066017151
0 references
0.8144531846046448
0 references
0.8134096264839172
0 references
