KDD 2024 - Fast Query of Biharmonic Distance in Networks

About this video

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

Describes an algorithm for fast querying of biharmonic distance in networks. Demonstrates a computational technique with concrete application to graph problems.

A 2-minute video from Association for Computing Machinery (ACM): “KDD 2024 - Fast Query of Biharmonic Distance in Networks”.

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