scientific article; zbMATH DE number 6469238
From MaRDI portal
Publication:5501357
Recommendations
- A characterization of easily testable induced digraphs and \(k\)-colored graphs
- Testing subgraphs in directed graphs
- Testing subgraphs in directed graphs
- Certifying induced subgraphs in large graphs
- Testing subdivision-freeness: property testing meets structural graph theory
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Testing subgraphs in large graphs
- Testing whether a digraph contains H-free k-induced subgraphs
Cited in
(32)- Bounds for graph regularity and removal lemmas
- Colorings with only rainbow arithmetic progressions
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Inflatable graph properties and natural property tests
- Introduction to testing graph properties
- Fast property testing and metrics for permutations
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- Nearly complete graphs decomposable into large induced matchings and their applications
- Hierarchy theorems for property testing
- Testing subgraphs in large graphs
- Introduction to testing graph properties
- Algorithmic Aspects of Property Testing in the Dense Graphs Model
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties
- Efficient testing without efficient regularity
- On the testability of graph partition properties
- Polynomial removal lemmas for ordered graphs
- Easily testable graph properties
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Testing graph blow-up
- Proximity Oblivious Testing and the Role of Invariances
- Testing graph blow-up
- Proximity oblivious testing and the role of invariances
- Testing subgraphs in directed graphs
- Testing subgraphs in directed graphs
- On the benefits of adaptivity in property testing of dense graphs
- Testing linear inequalities of subgraph statistics
- On regularity lemma and barriers in streaming and dynamic matching
- Testing Eulerianity and connectivity in directed sparse graphs
- Posets are easily testable
- Distribution-free connectivity testing for sparse graphs
- Testing whether a digraph contains H-free k-induced subgraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501357)
