Theory Lunch Seminar

Wednesday, November 25, 2015 - 12:00pm to 1:00pm


ASA Conference Room 6115 Gates & Hillman Centers


SHEN CHEN XU, Ph.D. Student

Problems about distances in graphs have proved to be difficult to parallelize. Compared to the sequential results, we often lose out in at least one aspect of solution quality, work, or depth. In this talk we give an approach that is centered around a graph decompositions scheme. We will describe a parallel graph clustering algorithm using exponential start time, and apply it to obtain work efficient spanner construction and the shortest path distance approximation. About the Speaker Sponsored in part by Yahoo! Labs

Event Website:

For More Information, Contact:


Seminar Series