On minimum maximal distance-\(k\) matchings (Q4560225)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6991625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On minimum maximal distance-\(k\) matchings |
scientific article; zbMATH DE number 6991625 |
Statements
10 December 2018
0 references
distance-\(k\) matching
0 references
\(k\)-equimatchable graph
0 references
computational complexity
0 references
0.9624141454696656
0 references
0.840055525302887
0 references
0.8338347673416138
0 references
0.8290765881538391
0 references
0.7955738306045532
0 references
