A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:25, 7 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
