Advanced Data Structures (Fall 2016)

Shay Mozes

Lecture 11 Video     [previous] [next]

[+] Dynamic connectivity and RMQ/LCA

We disucss a data structure for maitaining a graph under edge insertions, deletions and connectivity queries in polylogarithmic time. We then begin discussing the range minimum query problem and its relationship to the lowest common ancestor problem.

Download Video: 720p

[No lecture notes for this lecture.]

The video above should play if your web browser supports either modern Flash or HTML5 video with H.264 or WebM codec. The lecture notes should advance automatically. If you have any trouble with playback, email me.