A Characterization of Graph Properties Testable for General Planar Graphs with One-Sided Error
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 21-minute IEEE conference talk that delves into the characterization of graph properties testable for general planar graphs with one-sided error. Join speakers Artur Czumaj and Christian Sohler as they present their findings and insights on this important topic in graph theory and algorithm design.
Syllabus
A characterization of graph properties testable for general planar graphs with one sided error
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Natural Language ProcessingColumbia University via Coursera Intro to Algorithms
Udacity Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Paradigms of Computer Programming
Université catholique de Louvain via edX Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX