Testing Graph Isomorphism
From MaRDI portal
Recommendations
- The query complexity of graph isomorphism: bypassing distribution testing lower bounds
- scientific article; zbMATH DE number 1241385
- Property testing in bounded degree graphs
- The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance
- The difficulty of testing for isomorphism against a graph that is given in advance
Cited in
(15)- Robustly self-ordered graphs: constructions and applications to property testing
- TESTING EMBEDDABILITY BETWEEN METRIC SPACES
- Testing distributions of huge objects
- Generic case complexity of the graph isomorphism problem
- Sublinear algorithms in the external memory model
- Hierarchy theorems for property testing
- The query complexity of graph isomorphism: bypassing distribution testing lower bounds
- Robustly self-ordered graphs: constructions and applications to property testing
- The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance
- Distributed Testing of Graph Isomorphism in the CONGEST Model.
- On testing isomorphism to a fixed graph in the bounded-degree graph model
- Testing isomorphism in the bounded-degree graph model
- The difficulty of testing for isomorphism against a graph that is given in advance
- Efficient Method to Perform Isomorphism Testing of Labeled Graphs
- Testing forest-isomorphism in the adjacency list model
This page was built for publication: Testing Graph Isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614155)