Planar Graphs Have Bounded Queue-Number
Offered By: IEEE via YouTube
Course Description
Overview
Explore the concept of bounded queue-number in planar graphs through this 22-minute IEEE conference talk. Delve into the history of queue-number theory, examine various extensions, and understand HD compositions and H petitions as they relate to planar graphs. Gain insights from experts Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood as they present their findings and conclude with the implications of this research in graph theory.
Syllabus
QueueNumber
History
Extensions
HD compositions H petitions
Planar Graphs
Conclusion
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube