Pages that link to "Item:Q5084502"
From MaRDI portal
The following pages link to Greedy Matching in Bipartite Random Graphs (Q5084502):
Displaying 10 items.
- Greedy matching in Young's lattice (Q1813931) (← links)
- Matchings in random biregular bipartite graphs (Q1953449) (← links)
- The normalized matching property in random and pseudorandom bipartite graphs (Q2034078) (← links)
- Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs (Q2795749) (← links)
- Controllability and matchings in random bipartite graphs (Q3179073) (← links)
- (Q4344227) (← links)
- A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276) (← links)
- A stochastic matching model on hypergraphs (Q5013243) (← links)
- A natural barrier in random greedy hypergraph matching (Q5222558) (← links)
- The average size of maximal matchings in graphs (Q6497032) (← links)