Pages that link to "Item:Q4844489"
From MaRDI portal
The following pages link to Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs (Q4844489):
Displaying 6 items.
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs (Q612969) (← links)
- A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- Finding maximum matchings in random regular graphs in linear expected time (Q6049997) (← links)
- The average size of maximal matchings in graphs (Q6497032) (← links)