YoVDO

Towards Better Approximation of Graph Crossing Number

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Graph Theory Courses Computational Mathematics Courses Approximation Algorithms Courses

Course Description

Overview

Explore a 26-minute IEEE conference talk on improving approximations for graph crossing numbers. Delve into previous work on general and bounded-degree graphs, crossing numbers with rotation systems, and a new framework presented by Julia Chuzhoy, Sepideh Mahabadi, and Zihan Tan from Toyota Technological Institute at Chicago and the University of Chicago. Gain insights into the intuition behind Chuzhoy 11 and follow the plan for proving Main Theorem 1. Conclude with a comprehensive summary of the presented research and its implications for graph theory and computational geometry.

Syllabus

Intro
Graph Crossing Number
Previous Work on General Graphs
Previous Work on Bounded-Degree Graphs
Crossing Number with Rotation Systems
New Framework
Intuition Chuzhoy 11
Plan for Proving Main Theorem 1
Proof of Main Theorem 1
Summary


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Introducción a la informática: codificación de la información
Universitat Jaume I via Independent
Introducción al desarrollo de videojuegos con Unity3D
Universitat Jaume I via Independent
Numerical Analysis
Vidyasagar University via Swayam
Computational Mathematics with SageMath
Institute of Chemical Technology (ICT) via Swayam
Computational Commutative Algebra
NPTEL via YouTube