Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. - Anand Rajaraman - Document - PDFSEARCH.IO

First Page	Meta Content
	Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. Add to Reading List Document Date: 2014-08-11 13:15:52 Open Document File Size: 2,87 MB Share Result on Facebook IndustryTerm Online Algorithms You / online graph matching problem / offline algorithm / polynomial-time offline algorithm / / Movie Boys and Girls / / Organization Stanford University / / Person J. Leskovec / Anand Rajaraman / Jeff Ullman / / Position http / SportsLeague Stanford University / / Technology 9 Greedy algorithm / polynomial-time offline algorithm / / URL http / SocialTag Jeffrey Ullman Anand Rajaraman Computer science Hopcroft–Karp algorithm John Hopcroft Mathematics Matching Theoretical computer science

Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. Add to Reading List