GraphXD Seminar
Sep 28, 2017, 05:30 PM - 07:00 PM | 1011 Evans Hall | Happening As Scheduled
Tselil Schramm, Simons Institute, UC Berkeley (Speaker)
One of the greatest advantages of representing data with graphs is access to generic algorithms for analytic tasks, such as clustering. In this talk I will describe some popular graph clustering algorithms, and explain why they are well-motivated from a theoretical perspective.