YoVDO

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Offered By: IEEE via YouTube

Tags

Graph Theory Courses Computer Science Courses Algorithms Courses Data Structures Courses Network Analysis Courses Hypergraphs Courses

Course Description

Overview

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

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera