On minimum maximal distance-\(k\) matchings (Q509288)
From MaRDI portal
!
WARNING
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 6682413
| 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 6682413 |
Statements
On minimum maximal distance-\(k\) matchings (English)
0 references
9 February 2017
0 references
minimum maximal distance-\(k\) matching
0 references
computational complexity
0 references
\(k\)-equimatchable graphs
0 references
0.9624141454696656
0 references
0.840876042842865
0 references
0.8317399024963379
0 references
0.8212888240814209
0 references
0.8184902667999268
0 references
