Clément Canonne @ccanonne.github.io · Jun 8 The Karger–Klein–Tarjan algorithm (MST in expected linear time) is incredibly beautiful. A joy to teach and share (at least for me; at least one happy person in the classroom, I guess.) To compensate for how beautiful that algo is, I made handwritten slides: ccanonne.github.io/files/compx2...
13 likes 1 replies
?
Replies
These are meant to complement the second part of my course's lecture notes on randomized graph algorithms: ccanonne.github.io/files/compx2... (I'm not just subjecting students to my handwriting with nothing to save them)