Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter

About this video

Advanced · Editorial review · 85% confidence

Simons Institute for the Theory of Computing is already on Lumen; this upload was never considered before. Channel treated as academic (strict check, default pass); title passed a strict per-title check; oEmbed verified.

A 49-minute video from Simons Institute for the Theory of Computing: “Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter”.

Video by Simons Institute for the Theory of Computing, played through YouTube's embedded player.