scientific article; zbMATH DE number 1559556

zbMath0963.68154MaRDI QIDQ4527008

Oded Goldreich, Dana Ron

Publication date: 28 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph properties2-connectivity algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

Algebraic testing and weight distributions of codes. ⋮ Testing subgraphs in large graphs ⋮ The diameter of randomly perturbed digraphs and some applications ⋮ Testing the diameter of graphs ⋮ A lower bound for testing juntas ⋮ On Sampling Edges Almost Uniformly ⋮ Property testing on \(k\)-vertex-connectivity of graphs ⋮ Testing Eulerianity and connectivity in directed sparse graphs ⋮ A separation theorem in property testing ⋮ Testing problems with sublearning sample complexity ⋮ \(\omega\)-regular languages are testable with a constant number of queries ⋮ On Constant Time Approximation of Parameters of Bounded Degree Graphs ⋮ Functions that have read-once branching programs of quadratic size are not necessarily testable ⋮ On Testing Expansion in Bounded-Degree Graphs ⋮ Spot-checkers

This page was built for publication: