Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ECCC
2006

favoriteEmaildiscussreport

123views more ECCC 2006»

A Note on Adaptivity in Testing Properties of Bounded Degree Graphs

13 years 4 months ago

A Note on Adaptivity in Testing Properties of Bounded Degree Graphs

Download www.cse.psu.edu

We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving any answers. We call a property non-trivial if it does not depend only on the degree distribution of the nodes. We show that every tester for a non-trivial property that makes o ( n/d) queries to the input graph on n vertices of degree at most d has to be adaptive.

Sofya Raskhodnikova, Adam Smith

Real-time Traffic

Degree Model | ECCC 2006 | Graph Property Testing | Non-trivial |

claim paper

Related Content

» Testing Hereditary Properties of NonExpanding BoundedDegree Graphs

» A Lower Bound for Testing 3Colorability in BoundedDegree Graphs

» On Testing Expansion in BoundedDegree Graphs

» Every MinorClosed Property of Sparse Graphs is Testable

» An Expansion Tester for Bounded Degree Graphs

» Local Graph Partitions for Approximation and Testing

» A Note on the Distance to Monotonicity of Boolean Functions

» Testing subgraphs in directed graphs

» Planarity Allowing Few Error Vertices in Linear Time

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	ECCC
Authors	Sofya Raskhodnikova, Adam Smith

Comments (0)