Computer Science Speaking Skills Talk

Monday, February 1, 2016 - 12:00pm to 1:00pm


Traffic 21 Classroom 6501 Gates & Hillman Centers


SHEN CHEN XU, Ph.D. Student

Graph decompositions are widely used algorithmic routines. They partition the graph to enable divideand-conquer algorithms. In this talk we present a parallel and distributed algorithm for one particular graph decomposition, and apply it to the problem of constructing graph spanners.
Presented in Partial Fulfillment of the CSD Speaking Skills Requirement.

For More Information, Contact:


Speaking Skills