Every property of hyperfinite graphs is testable
From MaRDI portal
Publication:5419138
DOI10.1145/1993636.1993726zbMath1288.05064OpenAlexW2023060210MaRDI QIDQ5419138
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993726
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20) Extremal combinatorics (05D99)
Related Items
Approximate membership for regular languages modulo the edit distance ⋮ De-anonymization of heterogeneous random graphs in quasilinear time ⋮ Finite graphs and amenability ⋮ Sublinear DTD Validity ⋮ An Efficient Partitioning Oracle for Bounded-Treewidth Graphs ⋮ Unnamed Item