Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time (Q3578203)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a maximum matching in a sparse random graph in O ( n ) expected time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time |
scientific article |
Statements
Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time (English)
0 references
14 July 2010
0 references
