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

YouTube

Random K-Out Subgraph Leaves Only O-N-K- Inter-Component Edges

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 22-minute IEEE conference talk on random k-out subgraphs and their impact on inter-component edges. Delve into the research presented by Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, and Uri Zwick as they discuss the problem, previous studies, and applications in both general and dense graphs. Learn about connectivity, high-level proofs, sampling techniques, and edge removal processes. Examine the IDE components, the degrees method, and challenges associated with multigraphs. Gain insights into this complex topic through examples and a comprehensive exploration of the subject matter.

Syllabus

Introduction
Example
Problem
Warmup
Previous studies
General graphs
Dense graphs
Applications
Connectivity
Highlevel proof
How to sample
How to remove edges
Example of removing edges
Sampling edges
IDE components
The degrees method
Challenges
Multigraphs

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Random K-Out Subgraph Leaves Only O-N-K- Inter-Component Edges

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.