KDD 2023 - Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Covers densest diverse subgraph problems with application to social event planning. A KDD paper on graph optimization balancing density and diversity.

A 2-minute video from Association for Computing Machinery (ACM): “KDD 2023 - Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.