# l11 - 6.896 Sublinear Time Algorithms March 13, 2007...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6.896 Sublinear Time Algorithms March 13, 2007 Lecture 11 Lecturer: Ronitt Rubinfeld Scribe: Christina Sauper 1 Estimating the Number of Connected Components Given a graph G ( V,E ) with max degree d and adjacency list representation and some , we want to give an additive estimate of the number of connected components to within n . 1.1 Main Idea Define: n u number of nodes in u s component, where u V Fact 1 For any connected component A V : X u A 1 n u = X u A 1 | A | = 1 In addition, there are u V 1 n u connected components. Determining this value exactly takes O ( n 2 ) time, but we will estimate the sum and the values of n u . Define: n u min nodes in u s component , 2 c = X u V 1 n u Fact 2 The error in estimating 1 n u is small. 1 n u- 1 n u 2 Either n u = n u or n u > n u = 2 . In the latter case, 2 = 1 n u 1 n u 0. Therefore, the error is small, at most 2 ....
View Full Document

## This note was uploaded on 04/02/2010 for the course CS 6.896 taught by Professor Ronittrubinfeld during the Fall '04 term at MIT.

### Page1 / 4

l11 - 6.896 Sublinear Time Algorithms March 13, 2007...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online