On the public citation graph
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
0 signed · 72 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.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf00264025openalex-snapshot
Describing an algorithm by Hopcroft
inferredcites →https://doi.org/10.1016/0012-365x(76)90068-6openalex-snapshot
Hamiltonian circuits in random graphs
inferredcites →https://doi.org/10.1016/0095-8956(81)90090-3openalex-snapshot
Forest embeddings in regular graphs of large girth
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
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/c160016a007openalex-snapshot
A Graph-Theoretic Algorithm for Matching Chemical Structures.
inferredcites →https://doi.org/10.1137/0204018openalex-snapshot
Every Prime Has a Succinct Certificate
inferredcites →https://doi.org/10.1137/0207023openalex-snapshot
Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
inferredcites →https://doi.org/10.1145/321556.321562openalex-snapshot
An Efficient Algorithm for Graph Isomorphism
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.5486/pmd.1964.11.1-4.12openalex-snapshot
Abzählung von Wäldern eines gegebenen Typs in regulären und biregulären Graphen. I.
inferredcites →https://doi.org/10.5486/pmd.1965.12.1-4.02openalex-snapshot
Abzählung von Wäldern eines gegebenen Typs in regulären und biregulären Graphen. II.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-4563(199608)13:8<539::aid-rob5>3.0.co;2-oopenalex-snapshot
Mapping in unknown graph-like worlds
inferred← citeshttps://doi.org/10.1002/jcc.540090405openalex-snapshot
Combinatorial models and algorithms in chemistry. Search for isomorphisms and automorphisms of molecular graphs
inferred← citeshttps://doi.org/10.1002/jcc.540140204openalex-snapshot
Search for nondegenerate real vertex invariants and derived topological indexes
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_8openalex-snapshot
Computing and Drawing Isomorphic Subgraphs
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_49openalex-snapshot
A General Method for Graph Isomorphism
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/3-540-58328-9_19openalex-snapshot
Exploiting the induced order on type-labeled graphs for fast knowledge retrieval
inferred← citeshttps://doi.org/10.1007/3-540-60161-9_43openalex-snapshot
A linear descriptor for conceptual graphs and a class for polynomial isomorphism test
inferred← citeshttps://doi.org/10.1007/3-540-61534-2_10openalex-snapshot
Conceptual graphs isomorphism: Algorithm and use
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-2497-4_6openalex-snapshot
On Writing Isomorphism Programs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_9openalex-snapshot
Graph Isomorphism Restricted by Lists
inferred← citeshttps://doi.org/10.1007/978-3-642-18336-2_4openalex-snapshot
Greenhouse Temperature Monitoring System Based on Labview
inferred← citeshttps://doi.org/10.1007/s00373-002-0503-yopenalex-snapshot
On the Complexity of Polytope Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/s10032-003-0106-zopenalex-snapshot
A fast technique for comparing graph representations with applications to performance evaluation
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90037-3openalex-snapshot
A fast backtrack algorithm for graph isomorphism
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90011-4openalex-snapshot
An n log n algorithm for determining the congruity of polyhedra
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90090-3openalex-snapshot
Forest embeddings in regular graphs of large girth
inferred← citeshttps://doi.org/10.1016/0097-8485(87)80009-8openalex-snapshot
A matrix method for partitioning the atoms of a molecule into equivalence classes
inferred← citeshttps://doi.org/10.1016/0166-218x(81)90012-3openalex-snapshot
Concerning the complexity of deciding isomorphism of block designs
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90015-4openalex-snapshot
A non-factorial algorithm for canonical numbering of a graph
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90125-2openalex-snapshot
Pattern associativity and the retrieval of semantic networks
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/s0747-7171(85)80021-3openalex-snapshot
A General backtrack algorithm for the isomorphism problem of combinatorial objects
inferred← citeshttps://doi.org/10.1016/s0928-4869(00)00006-9openalex-snapshot
Metabolic reconstruction using shortest paths
inferred← citeshttps://doi.org/10.1023/a:1006133917784openalex-snapshot
Affine Isomorphism for Partially Ordered Sets
inferred← citeshttps://doi.org/10.1103/physreva.94.062317openalex-snapshot
Decoherence-enhanced performance of quantum walks applied to graph isomorphism testing
inferred← citeshttps://doi.org/10.1109/12.46284openalex-snapshot
On the number of acceptable task assignments in distributed computing systems
inferred← citeshttps://doi.org/10.1109/43.3221openalex-snapshot
A logic-to-logic comparator for VLSI layout verification
inferred← citeshttps://doi.org/10.1109/acssc.2017.8335178openalex-snapshot
Seeded graph matching: Efficient algorithms and theoretical guarantees
inferred← citeshttps://doi.org/10.1109/cicc.1993.590742openalex-snapshot
HCNC: High Capacity Netlist Compare
inferred← citeshttps://doi.org/10.1109/dac.1992.227789openalex-snapshot
Hcompare: a hierarchical netlist comparison program
inferred← citeshttps://doi.org/10.1109/iccad.1988.122520openalex-snapshot
GeminiII: a second generation layout validation program
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/iscas.1995.523738openalex-snapshot
A novel graph algorithm for circuit recognition
inferred← citeshttps://doi.org/10.1109/pacificvis.2009.4906842openalex-snapshot
A visual canonical adjacency matrix for graphs
inferred← citeshttps://doi.org/10.1109/rnns.1992.268621openalex-snapshot
On neural networks for graph isomorphism problem
inferred← citeshttps://doi.org/10.1109/tit.2020.2985059openalex-snapshot
Privacy of Dependent Users Against Statistical Matching
inferred← citeshttps://doi.org/10.1109/vdat.2010.5496758openalex-snapshot
Lump devices mapping between designer's schematic and layout extracted schematic in microwave frequency
inferred← citeshttps://doi.org/10.1145/1497561.1497573openalex-snapshot
External memory layout vs. schematic
inferred← citeshttps://doi.org/10.1145/1671970.1921702openalex-snapshot
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
inferred← citeshttps://doi.org/10.18452/16335openalex-snapshot
The structure of graphs and new logics for the characterization of Polynomial Time
inferred← citeshttps://doi.org/10.25911/5d7a2ba742b8copenalex-snapshot
Investigations into Satisfiability Search
inferred← citeshttps://doi.org/10.31274/etd-180810-635openalex-snapshot
Computation of evolutionary change
inferred← citeshttps://doi.org/10.3389/fncir.2018.00085openalex-snapshot
Analysis Tools for Large Connectomes
inferred← citeshttps://doi.org/10.3390/math13020228openalex-snapshot
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0710.1870openalex-snapshot
Lossless Representation of Graphs using Distributions
inferred← citeshttps://doi.org/10.70675/95fb364azf8b2z4edczb25dz3fc6ef2d836dopenalex-snapshot
Modélisation, approche polyédrale et approche arborescente pour des problèmes de comparaison de graphes
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.