scientific article; zbMATH DE number 7378665

DOI10.4230/LIPIcs.APPROX-RANDOM.2018.53MaRDI QIDQ5009551

Dana Ron, Yonatan Nakar

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph partition properties

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Property testing of the Boolean and binary rank ⋮ The minimum degree removal lemma thresholds

Cites Work

• Unnamed Item
• Testing k-colorability
• Graph removal lemmas
• Graph limits and parameter testing
• Property testing and its connection to learning and approximation
• A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
• Three theorems regarding testing graph properties
• Testing subgraphs in large graphs
• Removal lemmas with polynomial bounds
• A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
• Easily Testable Graph Properties
• Testing subgraphs in directed graphs
• Efficient testing of large graphs

This page was built for publication: