Four types of nested recursive methods for finding graph perfect matching numbers (Q2927318)
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 6365283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Four types of nested recursive methods for finding graph perfect matching numbers |
scientific article; zbMATH DE number 6365283 |
Statements
3 November 2014
0 references
perfect matching
0 references
linear recurrence relation
0 references
characteristic equation
0 references
Hamilton cycle
0 references
Four types of nested recursive methods for finding graph perfect matching numbers (English)
0 references
0.8796783089637756
0 references
0.8768290877342224
0 references
0.8723482489585876
0 references
