Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Planar Graphs Have Bounded Queue-Number

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Reviews

Start your review of Planar Graphs Have Bounded Queue-Number

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.