Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. Andriantiana EOD, Razanajatovo Misanantenaina V, Wagner S (2020) The average size of matchings in graphs. Graphs Comb 36(3):539–560
2. Arnosti N (2021) Greedy matching in bipartite random graphs. Stochastic Syst 12:133
3. Aronson J, Dyer M, Frieze A, Suen S (1994) On the greedy heuristic for matchings. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (USA, 1994), SODA ’94, Society for Industrial and Applied Mathematics, pp. 141–149
4. Aronson J, Dyer M, Frieze A, Suen S (1995) Randomized greedy matching. ii. Random Struct. Algorithms 6(1):55–73
5. Besser B, Poloczek M (2017) Greedy matching: guarantees and limitations. Algorithmica 77(1):201–234