The following pages link to Randomized greedy matching (Q3970901):
Displaying 18 items.
- Greedy matching: guarantees and limitations (Q513303) (← links)
- The average performance of the greedy matching algorithm (Q687707) (← links)
- An exact performance bound for an \(O(m+n)\) time greedy matching procedure (Q1378525) (← links)
- Erratum to: ``Greedy matching: guarantees and limitations'' (Q1702135) (← links)
- Greedy matching in Young's lattice (Q1813931) (← links)
- On randomized matching mechanisms (Q1814960) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- Lazy or eager dynamic matching may not be fast (Q2203578) (← links)
- Excuse me! or the courteous theatregoers' problem (Q2347004) (← links)
- Greedy Matching on the Line (Q3474883) (← links)
- Randomized greedy matching. II (Q4322476) (← links)
- Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907) (← links)
- Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs (Q4844489) (← links)
- Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- (Q5875458) (← links)
- The average size of maximal matchings in graphs (Q6497032) (← links)
- Greedy maximal independent sets via local limits (Q6541390) (← links)