Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis
| Computer Science/Discrete Mathematics Seminar I | |
| Topic: | Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis |
| Speaker: | Mario Szegedy |
| Affiliation: | Rutgers, The State University of New Jersey |
| Date: | Monday, April 30 |
| Time/Room: | 11:15am - 12:15pm/S-101 |
http://math.ias.edu/files/seminars/Szeg.pdf