Local graph exploration and fast property testing

Authors:
Artur Czumaj
Affiliations:
Centre for Discrete Mathematics and its Applications and Department of Computer Science, University of Warwick, UK
Venue:
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Year:
2010

Citing 18
Cited 0

Self-testing/correcting with applications to numerical problems

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
The regularity lemma and approximation schemes for dense problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Tight Bounds for Testing Bipartiteness in General Graphs

SIAM Journal on Computing
Approximating the Minimum Spanning Tree Weight in Sublinear Time

SIAM Journal on Computing
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

SIAM Journal on Computing
Sublinear-time approximation algorithms for clustering via random sampling

Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
Testing Expansion in Bounded-Degree Graphs

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error

SIAM Journal on Computing
Every minor-closed property of sparse graphs is testable

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An Expansion Tester for Bounded Degree Graphs

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Constant-Time Approximation Algorithms via Local Improvements

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

SIAM Journal on Computing
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity

SIAM Journal on Computing
Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time

SIAM Journal on Computing
Testing the expansion of a graph

Information and Computation
Local Graph Partitions for Approximation and Testing

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We will present some recent results about testing graph properties in sparse graphs and will discuss graph exploration techniques which allow very efficient algorithms for testing graph properties.