A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q583109 |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Alan M. Frieze / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963956266 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1209.6570 / rank | |||
Normal rank | |||
Latest revision as of 18:32, 19 April 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
