scientific article
From MaRDI portal
Publication:3549723
zbMath1231.68176MaRDI QIDQ3549723
Asaf Shapira, Itai Benjamini, Oded Schramm
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs ⋮ Property testing of planarity in the \textsf{CONGEST} model ⋮ Matchings on infinite graphs ⋮ Unnamed Item ⋮ Hierarchy theorems for property testing ⋮ Introduction to Testing Graph Properties ⋮ Testing Eulerianity and connectivity in directed sparse graphs ⋮ Testing \(k\)-edge-connectivity of digraphs ⋮ Testing Euclidean Spanners ⋮ Hierarchy Theorems for Property Testing ⋮ The Program of the Mini-Workshop ⋮ Sublinear-time Algorithms ⋮ Sublinear Graph Approximation Algorithms ⋮ Parameter testing in bounded degree graphs of subexponential growth ⋮ Hierarchy theorems for testing properties in size-oblivious query complexity ⋮ An Efficient Partitioning Oracle for Bounded-Treewidth Graphs ⋮ Introduction to Testing Graph Properties ⋮ Limits of random trees. II ⋮ Unnamed Item
This page was built for publication:
