Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Sparse Subgraphs of the D-Cube with Diameter D

Harvard CMSA via YouTube

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a mathematics research lecture from Harvard CMSA's Mathematics and Machine Learning Closing Workshop where researchers from Worcester Polytechnic Institute, University of Oxford, Aarhus University, and MIT explore the fascinating problem of edge deletion in hypercubes. Discover how the PatternBoost machine learning algorithm can be applied to find optimal solutions for maintaining diameter d when removing edges from d-dimensional hypercubes, building upon the foundational work of Erdos and colleagues. Learn about the interplay between local and global optimization techniques in this cutting-edge investigation of hypercube properties and graph theory.

Syllabus

Wagner et al. | Sparse subgraphs of the d-cube with diameter d

Taught by

Harvard CMSA

Reviews

Start your review of Sparse Subgraphs of the D-Cube with Diameter D

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.