scientific article; zbMATH DE number 6469238
From MaRDI portal
Publication:5501357
zbMath1318.68191MaRDI QIDQ5501357
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20)
Related Items
Polynomial removal lemmas for ordered graphs, Fast Property Testing and Metrics for Permutations, Nearly complete graphs decomposable into large induced matchings and their applications, On the benefits of adaptivity in property testing of dense graphs, Bounds for graph regularity and removal lemmas, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, Easily Testable Graph Properties, Hierarchy theorems for property testing, Unnamed Item, Algorithmic Aspects of Property Testing in the Dense Graphs Model, Introduction to Testing Graph Properties, Testing Eulerianity and connectivity in directed sparse graphs, Distribution-free connectivity testing for sparse graphs, Colorings with only rainbow arithmetic progressions, Efficient Testing without Efficient Regularity, Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs, Testing subgraphs in directed graphs, Testing Graph Blow-Up, Testing Graph Blow-Up, Proximity Oblivious Testing and the Role of Invariances, Proximity Oblivious Testing and the Role of Invariances, On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs, Inflatable Graph Properties and Natural Property Tests, Introduction to Testing Graph Properties, On the Query Complexity of Estimating the Distance to Hereditary Graph Properties, Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
