Matching algorithms are fast in sparse random graphs (Q2432523): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163768829 / rank | |||
Normal rank | |||
Latest revision as of 18:13, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matching algorithms are fast in sparse random graphs |
scientific article |
Statements
Matching algorithms are fast in sparse random graphs (English)
0 references
25 October 2006
0 references
