Event
Graduate Student Seminar - Lise Turner
Friday, February 2, 2018 12:00
Burnside Hall
Graduate Lounge, BURN 1024/1025, 805 rue Sherbrooke Ouest, Montreal, QC, H3A 0B9, CA
听
In this week's pizza talk, Lise Turner will tell us about spanning trees.听
Abstract:
This talk will be about spanning trees. We will look at three algorithms for generating spanning trees. The first is the classic algorithm for finding the minimal spanning tree in a weighted graph. The other two are for generating random spanning trees from random walks and were discovered by Aldous and Broder and by Wilson.