Adjacency Labelling for Planar Graphs - and Beyond

Adjacency Labelling for Planar Graphs - and Beyond

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 13

1 of 13

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Adjacency Labelling for Planar Graphs - and Beyond

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Adjacency Labelling
  3. 3 Universal Graphs Labeling schemes and universal graphs
  4. 4 Planar Graphs
  5. 5 The Strong Graph Product
  6. 6 The Product Structure Theorem
  7. 7 Binary Search Trees Any binary search tree can label a path
  8. 8 The Row Code Tree Biased binary search res
  9. 9 Bulk Insertion
  10. 10 Bulk Deletion
  11. 11 Rebalancing
  12. 12 Missing Pieces
  13. 13 Summary and Conclusions Summary

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.