On the public citation graph
A graph isomorphism algorithm for object recognition
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0012-365x(72)90056-8openalex-snapshot
Ranking the facets of the octahedron
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
inferredcites →https://doi.org/10.1016/0031-3203(92)90111-uopenalex-snapshot
Model matching in robot vision by subgraph isomorphism
inferredcites →https://doi.org/10.1016/0094-114x(91)90022-vopenalex-snapshot
Application of the hamming number technique to detect isomorphism among kinematic chains and inversions
inferredcites →https://doi.org/10.1016/0262-8856(95)91467-ropenalex-snapshot
Pattern recognition by homomorphic graph matching using Hopfield neural networks
inferredcites →https://doi.org/10.1016/s0167-5060(08)70319-4openalex-snapshot
Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
inferredcites →https://doi.org/10.1021/ci950061uopenalex-snapshot
GMA: A Generic Match Algorithm for Structural Homomorphism, Isomorphism, and Maximal Common Substructure Match and Its Applications
inferredcites →https://doi.org/10.1109/12.277286openalex-snapshot
Isomorphism of conflict graphs in multistage interconnection networks and its application to optimal routing
inferredcites →https://doi.org/10.1109/34.297953openalex-snapshot
A neural network approach to CSG-based 3-D object recognition
inferredcites →https://doi.org/10.1109/34.485558openalex-snapshot
Scaling theorems for zero crossings of bandlimited signals
inferredcites →https://doi.org/10.1109/34.491619openalex-snapshot
A graduated assignment algorithm for graph matching
inferredcites →https://doi.org/10.1109/34.682179openalex-snapshot
A new algorithm for error-tolerant subgraph isomorphism detection
inferredcites →https://doi.org/10.1109/tsmc.1984.6313232openalex-snapshot
A graph distance measure for image analysis
inferredcites →https://doi.org/10.1137/0209018openalex-snapshot
On the Complexity of Canonical Labeling of Strongly Regular Graphs
inferredcites →https://doi.org/10.1145/237814.238006openalex-snapshot
Faster isomorphism testing of strongly regular graphs
inferredcites →https://doi.org/10.1145/321556.321562openalex-snapshot
An Efficient Algorithm for Graph Isomorphism
inferredcites →https://doi.org/10.1177/002072099503200104openalex-snapshot
Invariant and Occluded Object Recognition Based on Graph Matching
inferredcites →https://doi.org/10.1209/0295-5075/3/11/015openalex-snapshot
A Neural Network for the Retrieval of Superimposed Connection Patterns
inferredcites →https://doi.org/10.1209/0295-5075/4/1/020openalex-snapshot
A Neural Network for Invariant Pattern Recognition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119654834.ch6openalex-snapshot
Pattern Recognition Concepts
inferred← citeshttps://doi.org/10.1007/3-540-44989-2_36openalex-snapshot
A Novel Neural Network Approach to Solve Exact and Inexact Graph Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/s00034-013-9587-2openalex-snapshot
An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs
inferred← citeshttps://doi.org/10.1007/s00034-015-0030-8openalex-snapshot
The SVE Method for Regular Graph Isomorphism Identification
inferred← citeshttps://doi.org/10.1007/s10444-012-9281-0openalex-snapshot
An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
inferred← citeshttps://doi.org/10.1016/j.cviu.2011.02.003openalex-snapshot
Exploiting local dependencies with spatial-scale space (S-Cube) for near-duplicate retrieval
inferred← citeshttps://doi.org/10.1016/j.ins.2013.11.008openalex-snapshot
A computational approach to construct a multivariate complete graph invariant
inferred← citeshttps://doi.org/10.1016/j.laa.2015.09.023openalex-snapshot
On the isomorphism of graphs having some eigenvalues of moderate multiplicity
inferred← citeshttps://doi.org/10.1016/j.mechmachtheory.2008.02.008openalex-snapshot
Isomorphism identification of graphs: Especially for the graphs of kinematic chains
inferred← citeshttps://doi.org/10.1016/j.neucom.2004.01.189openalex-snapshot
Solving inexact graph isomorphism problems using neural networks
inferred← citeshttps://doi.org/10.1016/s0167-8655(02)00253-2openalex-snapshot
A large database of graphs and its use for benchmarking graph isomorphism algorithms
inferred← citeshttps://doi.org/10.1088/1402-4896/adaf7eopenalex-snapshot
Alternated two-particle discrete-time quantum walk on arbitrary graphs and its application on graph isomorphism testing
inferred← citeshttps://doi.org/10.1109/access.2020.3005184openalex-snapshot
Consistency Penalized Graph Matching for Image-Based Identification of Dendritic Patterns
inferred← citeshttps://doi.org/10.1109/ecbs.2012.6487443openalex-snapshot
The challenges of a model transformation language
inferred← citeshttps://doi.org/10.1109/icmic.2011.5973730openalex-snapshot
An optimized algorithm for the identification of isomorphic undirected graphs
inferred← citeshttps://doi.org/10.1109/sisy.2012.6339500openalex-snapshot
The power of graph transformation - implementing a Shadow Casting algorithm
inferred← citeshttps://doi.org/10.1109/tcad.2011.2106370openalex-snapshot
Pattern-Mining for Behavioral Synthesis
inferred← citeshttps://doi.org/10.1109/tsipn.2024.3467921openalex-snapshot
Gotta Match 'Em All: Solution Diversification in Graph Matching Matched Filters
inferred← citeshttps://doi.org/10.1115/detc2007-34148openalex-snapshot
Isomorphism Identification of Graphs of Kinematic Chains
inferred← citeshttps://doi.org/10.1145/1344671.1344688openalex-snapshot
Pattern-based behavior synthesis for FPGA resource reduction
inferred← citeshttps://doi.org/10.1145/3712285.3759782openalex-snapshot
SIGMo: High-Throughput Batched Subgraph Isomorphism on GPUs for Molecular Matching
inferred← citeshttps://doi.org/10.1186/1471-2164-11-s1-s3openalex-snapshot
Computational approaches for detecting protein complexes from protein interaction networks: a survey
inferred← citeshttps://doi.org/10.32657/10356/53200openalex-snapshot
Mining protein complexes from protein interaction data
inferred← citeshttps://doi.org/10.32657/10356/53644openalex-snapshot
Local Dependencies for near-duplicate retrieva
inferred← citeshttps://doi.org/10.7155/jgaa.00139openalex-snapshot
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.