Parameter testing in bounded degree graphs of subexponential growth

DOI10.1002/rsa.20308zbMath1222.05240arXiv0711.2800OpenAlexW3083068705MaRDI QIDQ3055893

Gábor Elek

Publication date: 10 November 2010

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.2800

zbMATH Keywords

sequencesgraphparameter testingmeasurable equivalence relations

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Approximate Schreier decorations and approximate Kőnig's line coloring theorem ⋮ Infinite dimensional representations of finite dimensional algebras and amenability ⋮ Controllability, matching ratio and graph convergence ⋮ Every minor-closed property of sparse graphs is testable ⋮ Finite graphs and amenability ⋮ Borel oracles. An analytical approach to constant-time algorithms ⋮ Unnamed Item ⋮ An Efficient Partitioning Oracle for Bounded-Treewidth Graphs ⋮ Non-standard limits of graphs and some orbit equivalence invariants ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Remark on the continuity of the density of states of ergodic finite difference operators
• Limits of dense graph sequences
• \(L^{2}\)-spectral invariants and convergent sequences of finite graphs
• Hyperfinite graph limits
• On limits of finite graphs
• Some APX-completeness results for cubic graphs
• Recurrence of distributional limits of finite planar graphs
• Graph limits and parameter testing
• A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
• An Invitation to Random Schroedinger operators
• Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
• Approximation algorithms for NP-complete problems on planar graphs
• Testing versus Estimation of Graph Properties

This page was built for publication: Parameter testing in bounded degree graphs of subexponential growth