How to Use Beads and Strings to Find the Diameter of a Tree

From a channel Lumen includes in full: Polylog makes carefully argued algorithm and complexity explainers — P vs NP, A*, Byzantine generals, the busy beaver BB(5) proof, zero-knowledge proofs with Amit Sahai — written by theoretical computer scientists.

A 15-minute video from Polylog's catalogue; the title names its topic.

Video by Polylog, played through YouTube's embedded player.