Monday, February 1, 2016 - 12:00pm to 1:00pm
Location:Traffic 21 Classroom 6501 Gates & Hillman Centers
Speaker:SHEN CHEN XU, Ph.D. Student http://www.cs.cmu.edu/~shenchex/
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.