Testing versus estimation of graph properties

DOI10.1145/1060590.1060612MaRDI QIDQ3581386zbMATH OpenOpenAlexFDO

Authors Eldar Fischer, Ilan Newman

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Cited in

(10)

• Hardness of edge-modification problems
• Additive approximation for edge-deletion problems
• Tolerant property testing and distance approximation
• Introduction to testing graph properties
• Contemplations on Testing Graph Properties
• Introduction to testing graph properties
• Testing properties of graphs and functions
• 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

This page was built for publication: Testing versus estimation of graph properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581386)