Explore adjacency labelling for planar graphs and beyond in this 17-minute IEEE conference talk. Delve into topics such as universal graphs, labeling schemes, the strong graph product, and the product structure theorem. Learn about binary search trees and their application in labeling paths, as well as the row code tree and biased binary search. Discover techniques for bulk insertion, deletion, and rebalancing in graph labelling. Gain insights from experts including Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenakl Joret, Piotr Micek, and Pat Morin as they present their research findings and conclusions in this comprehensive overview of advanced graph theory concepts.
Overview
Syllabus
Intro
Adjacency Labelling
Universal Graphs Labeling schemes and universal graphs
Planar Graphs
The Strong Graph Product
The Product Structure Theorem
Binary Search Trees Any binary search tree can label a path
The Row Code Tree Biased binary search res
Bulk Insertion
Bulk Deletion
Rebalancing
Missing Pieces
Summary and Conclusions Summary
Taught by
IEEE FOCS: Foundations of Computer Science
