The Complexity of 3-Colouring H-Colourable Graphs
Offered By: IEEE via YouTube
Course Description
Overview
Explore the intricacies of graph theory in this 21-minute IEEE conference talk presented by Andrei Krokhin and Jakub Opršal. Delve into the fascinating world of graph coloring as the speakers examine the complexity of 3-colouring H-colourable graphs. Gain insights into the mathematical challenges and algorithmic approaches involved in this specific area of graph theory, enhancing your understanding of computational complexity and graph algorithms.
Syllabus
The complexity of 3-colouring H-colourable graphs
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera