Finding maximum matchings in random regular graphs in linear expected time (Q6049997)
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 maximum matchings in random regular graphs in linear expected time |
scientific article; zbMATH DE number 7748582
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximum matchings in random regular graphs in linear expected time |
scientific article; zbMATH DE number 7748582 |
Statements
Finding maximum matchings in random regular graphs in linear expected time (English)
0 references
11 October 2023
0 references
Karp-Sipser algorithm
0 references
maximum matching
0 references
random regular graph
0 references
0 references
0 references
