Skip to content

KDD 2024 - Making Temporal Betweenness Computation Faster and Restless

522 views

About this video

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

Covers faster temporal betweenness computation. Explains algorithms for computing node importance in temporal networks efficiently.

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