Tarjan on creating a linear expected time minimum spanning tree algorithm with Karger and Klein

Robert E. Tarjan, winner of the Association for Computing Machinery's A.M. Turing Award, discusses his work in the 1990s with David Karger and Phil Klein to devise the first linear expected time algorithm for the minimum spanning tree problem. This clip is taken from an interview conducted with Tarjan by Roy Levin for the ACM on July 12, 2017. Video of the full interview is available as part of Tarjan’s ACM profile at amturing.acm.org/award_winner....

[@qulinxao]

constant is :