Estimating the distance to a hereditary graph property

DOI10.1016/j.endm.2017.07.014zbMath1379.05093OpenAlexW2743038146WikidataQ101496311 ScholiaQ101496311MaRDI QIDQ1689980

Richard Lang, Henrique Stagni, Carlos Hoppen, Hanno Lefmann, Yoshiharu Kohayakawa

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.014

zbMATH Keywords

hereditary propertiesedit distanceparameter testing

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (2)

Earthmover Resilience and Testing in Ordered Structures ⋮ On the Query Complexity of Estimating the Distance to Hereditary Graph Properties

Cites Work

• A new proof of the graph removal lemma
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Bounds for graph regularity and removal lemmas
• Property testing and its connection to learning and approximation
• A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
• Estimating parameters associated with monotone properties
• Easily Testable Graph Properties
• Testing versus Estimation of Graph Properties

This page was built for publication: Estimating the distance to a hereditary graph property