New Notions and Constructions of Sparsification for Graphs and Hypergraphs
Offered By: IEEE via YouTube
Course Description
Overview
Explore cutting-edge research on graph and hypergraph sparsification in this 22-minute IEEE conference talk presented by Nikhil Bansal, Ola Svensson, and Luca Trevisan. Delve into innovative concepts and techniques for reducing the complexity of graph and hypergraph structures while preserving essential properties. Gain insights into the latest advancements in this field, which have significant implications for various areas of computer science and network analysis.
Syllabus
New Notions and Constructions of Sparsification for Graphs and Hypergraphs
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Introduction to High Dimensional Expanders - Irit DinurInstitute for Advanced Study via YouTube The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
IEEE via YouTube Graph Representation Learning and Its Applications to Biomedicine
Applied Algebraic Topology Network via YouTube Asaf Shapira - Local vs Global Combinatorics
International Mathematical Union via YouTube Tropical Solutions to Hard Problems in Auction Theory and Neural Networks - Lecture II
Hausdorff Center for Mathematics via YouTube