Testing graph properties with the container method
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3452883 (Why is no real title available?)
- Algorithmic Applications of Hypergraph and Partition Containers
- Algorithmic aspects of property testing in the dense graphs model
- Almost optimal canonical property testers for satisfiability
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Approximately counting independent sets in bipartite graphs via graph containers
- Efficient testing of large graphs
- Extremal Graphs without Large Forbidden Subgraphs
- Finding a planted clique by adaptive probing
- Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
- Hypergraph containers
- Independent sets in hypergraphs
- Introduction to Property Testing
- Mean, Median and Mode in Binomial Distributions
- Non-adaptive vs adaptive queries in the dense graph testing model
- On graphs with small subgraphs of large chromatic number
- On the benefits of adaptivity in property testing of dense graphs
- On the number of graphs without 4-cycles
- On the testability of graph partition properties
- Property testing and its connection to learning and approximation
- Property testing. Problems and techniques
- Stochastic Algorithms: Foundations and Applications
- Testing k-colorability
- Three theorems regarding testing graph properties
This page was built for publication: Testing graph properties with the container method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877562)
