Randomized greedy matching
From MaRDI portal
Publication:3970901
DOI10.1002/RSA.3240020104zbMATH Open0763.05080OpenAlexW1970411956WikidataQ56324116 ScholiaQ56324116MaRDI QIDQ3970901FDOQ3970901
Authors: Martin Dyer, Alan Frieze 
Publication date: 25 June 1992
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240020104
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (21)
- Erratum to: ``Greedy matching: guarantees and limitations
- On randomized matching mechanisms
- Excuse me! or the courteous theatregoers' problem
- Two faces of greedy leaf removal procedure on graphs
- Ranking on arbitrary graphs: rematch via continuous linear programming
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
- Greedy Matching on the Line
- Randomized greedy matching. II
- Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
- Greedy matching in Young's lattice
- The average size of maximal matchings in graphs
- Greedy matching in bipartite random graphs
- The average performance of the greedy matching algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Power balance and apportionment algorithms for the United States Congress
- Greedy maximal independent sets via local limits
- Greedy matching: guarantees and limitations
- Title not available (Why is that?)
- The matching process and independent process in random regular graphs and hypergraphs
- Lazy or eager dynamic matching may not be fast
This page was built for publication: Randomized greedy matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970901)
