Testing versus estimation of graph properties
From MaRDI portal
Publication:3581386
DOI10.1145/1060590.1060612zbMath1192.68480OpenAlexW2043632298MaRDI QIDQ3581386
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060612
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Related Items (10)
Additive approximation for edge-deletion problems ⋮ Testing properties of graphs and functions ⋮ Introduction to Testing Graph Properties ⋮ Distributed discovery of large near-cliques ⋮ Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing ⋮ Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs ⋮ Tolerant property testing and distance approximation ⋮ Introduction to Testing Graph Properties ⋮ Contemplations on Testing Graph Properties ⋮ Hardness of edge-modification problems
This page was built for publication: Testing versus estimation of graph properties
