Speaker：Prof. Li Ping (Beijing Jiaotong University， China)
Time：15 :30—16:30, 24th April, 2019
Place：Room 202, Building 20
Title：A local clustering algorithm for massive graphs
Abstract：A local graph algorithm is one that finds a solution containing or near a given vertex without looking at the whole graph. We will discuss a local clustering algorithm which finds a good cluster-a subset of vertices whose internal connections are significantly richer than its external connections. The running time of the algorithm, when it finds a local cluster, is nearly linear in the size of the cluster it outputs