On the public citation graph
A polynomial‐time algorithm for simple undirected graph isomorphism
0 signed · 34 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.1007/978-3-642-02011-7_21openalex-snapshot
Fast Algorithm for Graph Isomorphism Testing
inferredcites →https://doi.org/10.1007/s00034-010-9248-7openalex-snapshot
A New Algorithm for Isomorphism Determination of Undirected Graphs-Circuit Simulation Method
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/0262-8856(95)91467-ropenalex-snapshot
Pattern recognition by homomorphic graph matching using Hopfield neural networks
inferredcites →https://doi.org/10.1016/j.jfranklin.2005.04.006openalex-snapshot
Some further development on the eigensystem approach for graph isomorphism detection
inferredcites →https://doi.org/10.1016/s0303-2647(99)00041-6openalex-snapshot
Three dimensional DNA structures in computing
inferredcites →https://doi.org/10.1080/10020070512331341960openalex-snapshot
Algorithm of graph isomorphism with three dimensional DNA graph structures
inferredcites →https://doi.org/10.1109/fuzz48607.2020.9177559openalex-snapshot
A Fuzzy Theory Based Topological Distance Measurement for Undirected Multigraphs
inferredcites →https://doi.org/10.1109/ieom.2015.7093815openalex-snapshot
A genetic and iterative local search algorithm for solving subgraph isomorphism problem
inferredcites →https://doi.org/10.1109/mis.2021.3057590openalex-snapshot
An Efficient Solution to Detect Common Topologies in Money Launderings Based on Coupling and Connection
inferredcites →https://doi.org/10.1126/science.aad7416openalex-snapshot
Mathematician claims breakthrough in complexity theory
inferredcites →https://doi.org/10.1137/0210015openalex-snapshot
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
inferredcites →https://doi.org/10.1137/120892234openalex-snapshot
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
inferredcites →https://doi.org/10.1142/s0218001497000081openalex-snapshot
Recent Advances in Graph Matching
inferredcites →https://doi.org/10.1145/2897518.2897542openalex-snapshot
Graph isomorphism in quasipolynomial time [extended abstract]
inferredcites →https://doi.org/10.1145/321958.321963openalex-snapshot
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
inferredcites →https://doi.org/10.1145/800119.803896openalex-snapshot
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
inferredcites →https://doi.org/10.2307/2322953openalex-snapshot
The Genesis of the Abstract Group Concept: A Contribution to the History of the Origin of Abstract Group Theory.
inferredcites →https://doi.org/10.4230/lipics.esa.2017.60openalex-snapshot
Benchmark Graphs for Practical Graph Isomorphism
inferredcites →https://doi.org/10.54870/1551-3440.1166openalex-snapshot
GRAPH ISOMORPHISMS AND MATRIX SIMILARITY: SWITCHING BETWEEN REPRESENTATIONS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6563openalex-snapshot
Research of 6‐DOF pose estimation in stacked scenes
inferred← citeshttps://doi.org/10.1007/s11227-021-04123-6openalex-snapshot
An effective SPMV based on block strategy and hybrid compression on GPU
inferred← citeshttps://doi.org/10.1016/j.procs.2022.11.342openalex-snapshot
A new Technique in Protein Structure Quantitative Identification
inferred← citeshttps://doi.org/10.1108/ec-07-2022-0476openalex-snapshot
ISOMORPH: an efficient application on GPU for detecting graph isomorphism
inferred← citeshttps://doi.org/10.1109/access.2020.3024974openalex-snapshot
Prufer Coding: A Vectorization Method for Undirected Labeled Graph
inferred← citeshttps://doi.org/10.1109/fuzz48607.2020.9177559openalex-snapshot
A Fuzzy Theory Based Topological Distance Measurement for Undirected Multigraphs
inferred← citeshttps://doi.org/10.1109/iemcon56893.2022.9946631openalex-snapshot
On the Identification of Isomorphic Graphs for Graph Neural Network using Multi-graph Approach
inferred← citeshttps://doi.org/10.1145/3486622.3493971openalex-snapshot
Tri-skill variant Simplex and strongly polynomial-time algorithm for linear programming
inferred← citeshttps://doi.org/10.1145/3487553.3524724openalex-snapshot
A Triangle Framework among Subgraph Isomorphism, Pharmacophore and Structure-function Relationship
inferred← citeshttps://doi.org/10.1145/3498851.3499024openalex-snapshot
A Subgraph Isomorphism-based Attack Towards Social Networks
inferred← citeshttps://doi.org/10.1145/3701716.3715178openalex-snapshot
From Literature to Lab: Hardware-Independent Autonomous Chemical Synthesis with Reinforcement Learning
inferred← citeshttps://doi.org/10.1177/10943420211017188openalex-snapshot
A GPU-accelerated adaptive FSAI preconditioner for massively parallel simulations
inferred← citeshttps://doi.org/10.2514/6.2023-3789openalex-snapshot
ReaxFF Molecular Dynamics Simulations on Supercritical Pyrolysis of JP-10 with the Suspension of Nanoengineered Fuel Additives
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.