Author:
Besser Bert,Poloczek Matthias
Funder
Deutsche Forschungsgemeinschaft
Alexander von Humboldt-Stiftung
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference46 articles.
1. Angelopoulos, S., Borodin, A.: Randomized priority algorithms. Theor. Comput. Sci. 411(26–28), 2542–2558 (2010)
2. Aronson, J., Dyer, M.E., Frieze, A.M., Suen, S.: Randomized greedy matching II. Random Struct. Algorithms 6(1), 55–74 (1995)
3. Aronson, J., Frieze, A.M., Pittel, B.: Maximum matchings in sparse random graphs: Karp–Sipser revisited. Random Struct. Algorithms 12(2), 111–177 (1998)
4. Bennett, P., Bohman, T.: A Natural Barrier in Random Greedy Hypergraph Matching. CoRR (2012).
arXiv:1210.3581
5. Berger, B., Singh, R., Xu, J.: Graph algorithms for biological systems analysis. In: Proceedings of the Nineteenth Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 142–151 (2008)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献