Matching algorithms are fast in sparse random graphs (Q2432523)
From MaRDI portal
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
