On testing isomorphism to a fixed graph in the bounded-degree graph model

DOI10.1007/978-3-031-88946-2_17MaRDI QIDQ6877271zbMATH OpenFDO

Authors Oded Goldreich, Laliv Tauber

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-88946-2_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Computational complexity and local algorithms. On the interplay between randomness and computation
• Every property of hyperfinite graphs is testable
• Introduction to Property Testing
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Property testing in bounded degree graphs
• Robustly self-ordered graphs: constructions and applications to property testing
• Testing forest-isomorphism in the adjacency list model
• Testing Graph Isomorphism
• The isoperimetric number of random regular graphs

This page was built for publication: On testing isomorphism to a fixed graph in the bounded-degree graph model

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