l13 - 6.896 Sublinear Time Algorithms March 20, 2007...

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

View Full Document Right Arrow Icon
6.896 Sublinear Time Algorithms March 20, 2007 Lecture 13 Lecturer: Ronitt Rubinfeld Scribe: Huy Ngoc Nguyen 1 Bipartiteness testing on dense graph Defnition 1 G is ” ± far ” from bipartiteness if must remove at least ±n 2 edges to make it bipartite. Defnition 2 (equivalent to deFnition 1) partitions ( V 1 ,V 2 ) of V there are at least ±n 2 edges ( w, v ) s.t either u, v V 1 or u, v V 2 (in this case ( u, v ) is a violating pair ). Algorithm (1): : TestBipartite( A , G ) ( A - adjacency matrix for G ) choose sample S uniformly s.t | S | =Θ( 1 ± 2 log 1 ± ) 1 query A ( u, v ) u, v S . 2 FAIL if subgraph not bipartite else PASS. 3 Note: total number of queries : O ( 1 ε 4 log 2 1 ε ) Theorem 1 The algorithm is a property tester for bipartiteness. More precisely, (1) if G is bipartite, TestBipartite PASSES. (2) if G is ε far from bipartiteness, Pr [ TestBipartite ±AILS ] 3 4 . ProoF Consider the following algorithm, Algorithm (2) : Choose U uniformly, s.t | U | = O ( 1 ε log 1 ε ) 1 Choose a bunch of pairs (
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the 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 / 3

l13 - 6.896 Sublinear Time Algorithms March 20, 2007...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online