This preview shows page 1. Sign up to view the full content.
Unformatted text preview: of G is a decomposition into O ( n/ ) vertex-disjoint connected pieces , each with ( ) vertices. Recall that a clustering, if computed eciently, can be used to compute an r division in o ( n log n ) time. Give a linear-time algorithm to compute a clustering for any graph with maximum degree three....
View Full Document
- Fall '11