Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (Q3521916)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time |
scientific article |
Statements
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (English)
0 references
28 August 2008
0 references
