On the public citation graph
Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
0 signed · 61 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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.4490090108openalex-snapshot
Initial vertex partitioning and testing isomorphism of graphs and digraphs
inferred← citeshttps://doi.org/10.1002/net.21514openalex-snapshot
Theoretical and computational advances for network diversion
inferred← citeshttps://doi.org/10.1002/net.3230110103openalex-snapshot
On testing isomorphism of permutation graphs
inferred← citeshttps://doi.org/10.1007/11780342_26openalex-snapshot
On Graph Isomorphism for Restricted Graph Classes
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_23openalex-snapshot
The Complexity of Boolean Matrix Root Computation
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_76openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/978-0-387-35699-0_12openalex-snapshot
Graph Isomorphism Algorithm by Perfect Matching
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_21openalex-snapshot
The Basic Class W[1] and an Analog of Cook’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_12openalex-snapshot
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-75530-9_4openalex-snapshot
Robotic Vision Knowledge System
inferred← citeshttps://doi.org/10.1007/bf01068686openalex-snapshot
Construction of an effective algorithm to find the isomorphism of two simple finite semigroups
inferred← citeshttps://doi.org/10.1007/bf01182098openalex-snapshot
The isomorphism problem for varieties generated by a two-element algebra
inferred← citeshttps://doi.org/10.1007/bf01578845openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/bfb0012777openalex-snapshot
A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties
inferred← citeshttps://doi.org/10.1007/s00012-021-00742-5openalex-snapshot
The complexity of homomorphism factorization
inferred← citeshttps://doi.org/10.1007/s00373-002-0503-yopenalex-snapshot
On the Complexity of Polytope Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/s10852-010-9145-xopenalex-snapshot
Isomorphism Testing via Polynomial-Time Graph Extensions
inferred← citeshttps://doi.org/10.1016/0022-0000(79)90043-6openalex-snapshot
Graph isomorphism, general remarks
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90015-0openalex-snapshot
Subcomplete generalizations of graph isomorphism
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90005-4openalex-snapshot
Perfect matching for regular graphs is AC0-hard for the general matching problem
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/0166-218x(86)90074-0openalex-snapshot
Testing homotopy equivalence is isomorphism complete
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90226-9openalex-snapshot
Testing for grammatical coverings
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/j.artint.2013.11.004openalex-snapshot
The complexity of manipulative attacks in nearly single-peaked electorates
inferred← citeshttps://doi.org/10.1016/j.automatica.2013.08.007openalex-snapshot
Discrete-event modeling of multi-agent systems with broadcasting-based parallel composition
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.038openalex-snapshot
Complexity results in graph reconstruction
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.10.337openalex-snapshot
A Formal Modular Synthesis Approach for the Coordination of Multi-Agent Systems
inferred← citeshttps://doi.org/10.1016/j.inffus.2013.05.006openalex-snapshot
A fuzzy graph matching approach in intelligence analysis and maintenance of continuous situational awareness
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103632openalex-snapshot
How similar are two elections?
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.041openalex-snapshot
The complexity of Boolean matrix root computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.010openalex-snapshot
Compatible topologies on graphs: An application to graph isomorphism problem complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.017openalex-snapshot
Computational complexity of problems for deterministic presentations of sofic shifts
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70859-8openalex-snapshot
The Complexity of Combinatorial Isomorphism Problems
inferred← citeshttps://doi.org/10.1051/ita/1986200201911openalex-snapshot
How much semigroup structure is needed to encode graphs ?
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1080/00207168808803657openalex-snapshot
The complexity of computing the automorphism group of automata and related problems
inferred← citeshttps://doi.org/10.1109/71.491584openalex-snapshot
Graph isomorphism and identification matrices: parallel algorithms
inferred← citeshttps://doi.org/10.1109/acsd.2009.8openalex-snapshot
Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete
inferred← citeshttps://doi.org/10.1109/tsg.2022.3231592openalex-snapshot
Privacy-Preserving Regulation Capacity Evaluation for HVAC Systems in Heterogeneous Buildings Based on Federated Learning and Transfer Learning
inferred← citeshttps://doi.org/10.1109/tsmc.1980.4308365openalex-snapshot
Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing
inferred← citeshttps://doi.org/10.1109/tsmc.1986.289319openalex-snapshot
A New Algorithm for Graph Monomorphism Based on the Projections of the Product Graph
inferred← citeshttps://doi.org/10.1137/0209025openalex-snapshot
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1142/s0218196706002846openalex-snapshot
INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
inferred← citeshttps://doi.org/10.1145/990524.990529openalex-snapshot
A clique problem equivalent to graph isomorphism
inferred← citeshttps://doi.org/10.20429/tag.2021.080108openalex-snapshot
The Structure Of Functional Graphs For Functions From A Finite Domain To Itself For Which A Half Iterate Exists
inferred← citeshttps://doi.org/10.3233/fi-222110openalex-snapshot
Nominal Unification and Matching of Higher Order Expressions with Recursive Let
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.0708.4075openalex-snapshot
Graph Isomorphism is PSPACE-complete
inferred← citeshttps://doi.org/10.48550/arxiv.0903.0136openalex-snapshot
A polynomial graph extension procedure for improving graph isomorphism algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1105.5032openalex-snapshot
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0642openalex-snapshot
Breaking the n^(log n) Barrier for Solvable-Group Isomorphism
inferred← citeshttps://doi.org/10.48550/arxiv.1708.05640openalex-snapshot
A similarity criterion for sequential programs using truth-preserving partial functions
inferred← citeshttps://doi.org/10.70675/150e8dfdz60abz447bzad32z6b94f3f90094openalex-snapshot
Strategy complexity of zero-sum games on 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.