A graph isomorphism algorithm for object recognition
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A graph distance measure for image analysis
- Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
- An Efficient Algorithm for Graph Isomorphism
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- Random Graph Isomorphism
- The graph isomorphism disease
Cited in
(13)- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- A heuristic algorithm of recognition of isomorphism of graphs
- scientific article; zbMATH DE number 1744976 (Why is no real title available?)
- scientific article; zbMATH DE number 2033159 (Why is no real title available?)
- Efficient Suboptimal Graph Isomorphism
- scientific article; zbMATH DE number 2102042 (Why is no real title available?)
- The SVE method for regular graph isomorphism identification
- A computational approach to construct a multivariate complete graph invariant
- scientific article; zbMATH DE number 3929036 (Why is no real title available?)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity
- Isomorphism identification of graphs: especially for the graphs of kinematic chains
- Isomorphism testing via polynomial-time graph extensions
This page was built for publication: A graph isomorphism algorithm for object recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273874)