scientific article; zbMATH DE number 6846422

DOI10.4230/LIPICS.ESA.2016.51zbMATH Open1397.68141arXiv1504.00766MaRDI QIDQ4606322FDOQ4606322

Authors: Hiro Ito 

Publication date: 2 March 2018

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

Title of this publication is not available (Why is that?)

Recommendations

• Every property of hyperfinite graphs is testable
• Every property of hyperfinite graphs is testable
• Every property of outerplanar graphs is testable
• A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
• Every monotone graph property is testable
• Every Monotone Graph Property Is Testable
• A combinatorial characterization of the testable graph properties, it's all about regularity
• On testable properties in bounded degree graphs
• scientific article; zbMATH DE number 1792102
• Property testing in bounded degree graphs

zbMATH Keywords

complex networksscale-free networkshyperfiniteconstant-time algorithmsisolated cliques

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Cited In (2)

• Planar graphs: random walks and bipartiteness testing
• Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty

This page was built for publication:

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