Summary

Keywords

6-851-advanced-data-structures-spring-2012 decremental connectivity dynamic graphs euler tour trees fully dynamic connectivity o(1) o(lg2 n) survey

Full Transcript

MIT 6.851 Advanced Data Structures, Spring 2012 View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Dynamic graphs: Euler tour trees, decremental connectivity in trees in O(1), fully dynamic connectivity in O(lg2 n), survey License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

30-Day Beginner Guitar Challenge for New Players

Master the Guitar in 30 Days: Your Ultimate Beginner Challenge! Unleash your inner guitarist with step-by-step lessons designed to transform you from novice to confident player. Join Your Guitar Academy and kickstart your musical journey today!

⭐ 4.3

36 ratings

7 hours