A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q583109 |
||
| Property / author | |||
| Property / author: Q228771 / rank | |||
Revision as of 07:21, 16 February 2024
scientific article; zbMATH DE number 6919505
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
