Pages that link to "Item:Q6049997"
From MaRDI portal
The following pages link to Finding maximum matchings in random regular graphs in linear expected time (Q6049997):
Displaying 7 items.
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- Matching algorithms are fast in sparse random graphs (Q2432523) (← links)
- Karp–Sipser on Random Graphs with a Fixed Degree Sequence (Q3103622) (← links)
- A Fast Perfect-Matching Algorithm in Random Graphs (Q3360222) (← links)
- Average-case analysis of algorithms for matchings and related problems (Q4327634) (← links)
- A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276) (← links)
- STACS 2004 (Q5309689) (← links)