A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276)
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: A greedy algorithm for finding a large 2‐matching on a random cubic graph |
scientific article; zbMATH DE number 6919505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy algorithm for finding a large 2‐matching on a random cubic graph |
scientific article; zbMATH DE number 6919505 |
Statements
A greedy algorithm for finding a large 2‐matching on a random cubic graph (English)
0 references
16 August 2018
0 references
greedy algorithm
0 references
2-matching
0 references
random cubic graph
0 references
0.9330621
0 references
0.8975444
0 references
0.8916816
0 references
0.89132804
0 references
0.8874753
0 references
