Unformatted text preview: of G is a decomposition into O ( n/ρ ) vertexdisjoint connected pieces , each with Θ( ρ ) vertices. Recall that a ρ –clustering, if computed eﬃciently, can be used to compute an r –division in o ( n log n ) time. Give a lineartime algorithm to compute a ρ –clustering for any graph with maximum degree three....
View
Full
Document
This note was uploaded on 01/20/2012 for the course CS 6.889 taught by Professor Erikdemaine during the Fall '11 term at MIT.
 Fall '11
 ErikDemaine
 Algorithms

Click to edit the document details