Testing depth first search numbering
From MaRDI portal
Cites work
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Depth-First Search and Linear Graph Algorithms
- Edge-disjoint spanning trees and depth-first search
- Efficient Planarity Testing
- Every minor-closed property of sparse graphs is testable
- Every property of hyperfinite graphs is testable
- Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
- Finding cycles and trees in sublinear time
- scientific article; zbMATH DE number 1775414 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Introduction to Property Testing
- Le problème des labyrinthes.
- Local Graph Partitions for Approximation and Testing
- On Proximity-Oblivious Testing
- On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Property testing. Problems and techniques
- Robust Characterizations of Polynomials with Applications to Program Testing
- Strong lower bounds for approximating distribution support size and the distinct elements problem
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
This page was built for publication: Testing depth first search numbering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322486)
