BrighterTube

WSDM-23 Paper: DeMEtRIS: Counting (near)-Cliques by Crawling

Association for Computing Machinery (ACM)49.8K subscribers

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

Introduces DeMEtRIS, a method for counting near-cliques in graphs through crawling. Teaches approximation algorithms for subgraph counting in large graphs.

A 17-minute video from Association for Computing Machinery (ACM): “WSDM-23 Paper: DeMEtRIS: Counting (near)-Cliques by Crawling”.

Programming & CSScience & Math

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

Part of WSDM 2023