On the public citation graph
Some NP-Complete Problems Similar to Graph Isomorphism
0 signed · 136 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/0020-0190(79)90004-8openalex-snapshot
A note on the graph isomorphism counting problem
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/322123.322125openalex-snapshot
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
inferredcites →https://doi.org/10.1145/990524.990529openalex-snapshot
A clique problem equivalent to graph isomorphism
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20293openalex-snapshot
Neighborhood hypergraphs of bipartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.20544openalex-snapshot
On the complexity of reconstructing H-free graphs from their Star Systems
inferred← citeshttps://doi.org/10.1006/inco.1996.0097openalex-snapshot
A Note on Decision versus Search for Graph Automorphism
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-37623-2_15openalex-snapshot
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
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-45848-4_15openalex-snapshot
Detecting Symmetries by Branch & Cut
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_16openalex-snapshot
Drawing Graphs Symmetrically in Three Dimensions
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_16openalex-snapshot
Graph automorphisms with maximal projection distances
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_30openalex-snapshot
Finding Planar Geometric Automorphisms in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_1openalex-snapshot
Reconstruction Problems for Digraphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_654openalex-snapshot
Symmetric Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_5openalex-snapshot
Recognizing Hyperelliptic Graphs in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_38openalex-snapshot
Symmetry Detection and Classification in Drawings of Graphs
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-031-39144-6_10openalex-snapshot
Symmetry and Dominance Breaking for Pseudo-Boolean Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-91124-8_5openalex-snapshot
Re-randomize and Extract: A Novel Commitment Construction Framework Based on Group Actions
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_2openalex-snapshot
The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-14803-8_30openalex-snapshot
Mechanical Generation of Networks with Surplus Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_38openalex-snapshot
When is Red-Blue Nonblocker Fixed-Parameter Tractable?
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_23openalex-snapshot
NP-Completeness Results for Deductive Problems on Stratified Terms
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_28openalex-snapshot
On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_52openalex-snapshot
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_17openalex-snapshot
On the Complexity of Reconstructing H-free Graphs from Their Star Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_654-1openalex-snapshot
Symmetric Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-29923-0_12openalex-snapshot
Enhancing Source Selection for Live Queries over Linked Data via Query Log Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_5openalex-snapshot
Reconstruction Problems for Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_41openalex-snapshot
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-981-15-3928-2_4openalex-snapshot
Efficient Parallel Subgraph Enumeration
inferred← citeshttps://doi.org/10.1007/bf00338740openalex-snapshot
The complexity of the fixed point property
inferred← citeshttps://doi.org/10.1007/bf01086177openalex-snapshot
Graph theory (algorithmic, algebraic, and metric problems)
inferred← citeshttps://doi.org/10.1007/bf02104831openalex-snapshot
Combinatorial analysis (nonnegative matrices, algorithmic problems)
inferred← citeshttps://doi.org/10.1007/bfb0038465openalex-snapshot
Computational complexity of geometric symmetry detection in graphs
inferred← citeshttps://doi.org/10.1007/s00224-007-9077-7openalex-snapshot
Computing Graph Automorphism from Partial Solutions
inferred← citeshttps://doi.org/10.1007/s00373-002-0503-yopenalex-snapshot
On the Complexity of Polytope Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/s00453-002-1011-4openalex-snapshot
Drawing Trees Symmetrically in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-004-1132-zopenalex-snapshot
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-008-9275-yopenalex-snapshot
A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00454-006-1231-5openalex-snapshot
A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs
inferred← citeshttps://doi.org/10.1007/s10107-003-0409-3openalex-snapshot
Detecting symmetries by branch & cut
inferred← citeshttps://doi.org/10.1007/s11263-022-01709-2openalex-snapshot
Shuffled Linear Regression with Outliers in Both Covariates and Responses
inferred← citeshttps://doi.org/10.1007/s42979-019-0020-1openalex-snapshot
Improved QUBO Formulation of the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90271-5openalex-snapshot
Le probleme d'etoiles pour graphes est np-complet
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00104-qopenalex-snapshot
Realizability and uniqueness in graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90012-5openalex-snapshot
A correction to Colbourn's paper on the complexity of matrix symmetrizability
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90015-0openalex-snapshot
Subcomplete generalizations of graph isomorphism
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90183-wopenalex-snapshot
Quadratic forms and the graph isomorphism problem
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90026-8openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.027openalex-snapshot
Geometric automorphism groups of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.03.023openalex-snapshot
Neighborhood hypergraphs of digraphs and some matrix permutation problems
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.036openalex-snapshot
On the subgroup distance problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.08.005openalex-snapshot
Linear optimization over permutation groups
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.002openalex-snapshot
Circulant graphs: efficient recognizing and isomorphism testing
inferred← citeshttps://doi.org/10.1016/j.endm.2015.07.062openalex-snapshot
On Rotational Symmetries of Drawings of Coherent Periodic Graphs
inferred← citeshttps://doi.org/10.1016/j.jksuci.2016.11.007openalex-snapshot
MSP: Multiple Sub-graph Query Processing using Structure-based Graph Partitioning Strategy and Map-Reduce
inferred← citeshttps://doi.org/10.1016/j.laa.2022.03.003openalex-snapshot
Characterizing and computing weight-equitable partitions of graphs
inferred← citeshttps://doi.org/10.1016/j.patcog.2017.09.030openalex-snapshot
Diffusion wavelet embedding: A multi-resolution approach for graph embedding in vector space
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.2009.01.001openalex-snapshot
Computational complexity of computing a partial solution for the Graph Automorphism problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.014openalex-snapshot
Applications of dimensionality reduction and exponential sums to graph automorphism
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.007openalex-snapshot
Finding fixed point free elements and small bases in permutation groups
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.02.013openalex-snapshot
Recognizing hyperelliptic graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00050-8openalex-snapshot
On the isomorphism of expressions
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70857-4openalex-snapshot
Isomorphism Testing and Symmetry of Graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00273-4openalex-snapshot
Algorithms for the fixed point property
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00020-1openalex-snapshot
Drawing series parallel digraphs symmetrically☆☆This research has been supported by an Australian Research Council Grant, KOSEF postdoctoral fellowship, and the SCARE project at the University of Limerick.
inferred← citeshttps://doi.org/10.1017/9781316135167.027openalex-snapshot
A Symmetric Strategy in Graph Avoidance Games
inferred← citeshttps://doi.org/10.1017/s0963548300000535openalex-snapshot
Reconstructing a Graph from its Neighborhood Lists
inferred← citeshttps://doi.org/10.1038/s42005-026-02543-5openalex-snapshot
Equitability and explosive synchronisation in multiplex and higher-order networks
inferred← citeshttps://doi.org/10.1063/5.0311913openalex-snapshot
SeQuant framework for symbolic and numerical tensor algebra. I. Core capabilities
inferred← citeshttps://doi.org/10.1080/1536383x.2017.1386657openalex-snapshot
Predicting melting points of hydrocarbons by the Graovac-Pisanski index
inferred← citeshttps://doi.org/10.1090/s1061-0022-04-00833-7openalex-snapshot
Circulant graphs: recognizing and isomorphism testing in polynomial time
inferred← citeshttps://doi.org/10.1098/rsif.2023.0306openalex-snapshot
Symmetry in models of natural selection
inferred← citeshttps://doi.org/10.1109/advcomp.2008.34openalex-snapshot
Searching and Ranking Similar Clusters of Polyhedra in Crystal Structures
inferred← citeshttps://doi.org/10.1109/aswec.2014.15openalex-snapshot
On the Shape of Circular Dependencies in Java Programs
inferred← citeshttps://doi.org/10.1109/ccc.1996.507689openalex-snapshot
A note on decision versus search for graph automorphism
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039450openalex-snapshot
A graph-theoretic classification for the controllability of the Laplacian leader-follower dynamics
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.154openalex-snapshot
An Efficient Graph Isomorphism Algorithm Based on Canonical Labeling and Its Parallel Implementation on GPU
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413614openalex-snapshot
Fast Graph Kernel with Optical Random Features
inferred← citeshttps://doi.org/10.1109/percom.2009.4912772openalex-snapshot
Privacy-preserving event detection in pervasive spaces
inferred← citeshttps://doi.org/10.1109/smartcity.2015.168openalex-snapshot
Variants of Graph Matching for Tree-like Graphs
inferred← citeshttps://doi.org/10.1109/tac.2014.2381435openalex-snapshot
Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
inferred← citeshttps://doi.org/10.1109/tcns.2016.2631429openalex-snapshot
Symmetry Reduction for Performance Certification of Interconnected Systems
inferred← citeshttps://doi.org/10.1109/tdsc.2022.3199326openalex-snapshot
A Comparison of Four Notions of Isomorphism-Based Security for Graphs
inferred← citeshttps://doi.org/10.1109/tvcg.2022.3229354openalex-snapshot
Automorphism Faithfulness Metrics for Symmetric Graph Drawings
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2008.01273.xopenalex-snapshot
Global Intrinsic Symmetries of Shapes
inferred← citeshttps://doi.org/10.1111/rssc.12170openalex-snapshot
Optimal Design of Experiments on Connected Units with Application to Social Networks
inferred← citeshttps://doi.org/10.1137/15m1013262openalex-snapshot
Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum
inferred← citeshttps://doi.org/10.1137/s0097539791198900openalex-snapshot
Homeomorphism of 2-Complexes is Graph Isomorphism Complete
inferred← citeshttps://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferred← citeshttps://doi.org/10.1145/167088.167245openalex-snapshot
Monotone monadic SNP and constraint satisfaction
inferred← citeshttps://doi.org/10.1145/2588555.2588557openalex-snapshot
Parallel subgraph listing in a large-scale graph
inferred← citeshttps://doi.org/10.1145/2886095openalex-snapshot
The Exact Complexity of the First-Order Logic Definability Problem
inferred← citeshttps://doi.org/10.1145/3029806.3029827openalex-snapshot
Graph Automorphism-Based, Semantics-Preserving Security for the Resource Description Framework (RDF)
inferred← citeshttps://doi.org/10.1145/3106426.3106534openalex-snapshot
Efficient processing of SPARQL queries over GraphFrames
inferred← citeshttps://doi.org/10.1145/3551349.3556954openalex-snapshot
Exploiting Epochs and Symmetries in Analysing MPI Programs
inferred← citeshttps://doi.org/10.1145/3580478openalex-snapshot
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas
inferred← citeshttps://doi.org/10.1145/3597503.3639192openalex-snapshot
Detecting Automatic Software Plagiarism via Token Sequence Normalization
inferred← citeshttps://doi.org/10.1145/3689031.3717474openalex-snapshot
OHMiner: An Overlap-centric System for Efficient Hypergraph Pattern Mining
inferred← citeshttps://doi.org/10.1214/15-aoas834openalex-snapshot
Vertex nomination schemes for membership prediction
inferred← citeshttps://doi.org/10.1371/journal.pone.0097896openalex-snapshot
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
inferred← citeshttps://doi.org/10.14257/ijhit.2016.9.6.18openalex-snapshot
Using the Eigenvalue Partition to Compute the Automorphism Group
inferred← citeshttps://doi.org/10.1515/fcds-2016-0010openalex-snapshot
Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees
inferred← citeshttps://doi.org/10.17760/d20316246openalex-snapshot
Any-k evaluation of conjunctive queries and its application to graph pattern matching
inferred← citeshttps://doi.org/10.20868/upm.thesis.70082openalex-snapshot
Latin Polytopes and Their Applications
inferred← citeshttps://doi.org/10.22028/d291-26350openalex-snapshot
Riemann-Roch theory for sublattices of the root lattice An, graph automorphisms and counting cycles in graphs
inferred← citeshttps://doi.org/10.22331/q-2025-04-24-1720openalex-snapshot
The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
inferred← citeshttps://doi.org/10.22360/springsim.2016.msciaasspace.014openalex-snapshot
On the Complexity of Interoperability
inferred← citeshttps://doi.org/10.3390/sym10010029openalex-snapshot
How Symmetric Are Real-World Graphs? A Large-Scale Study
inferred← citeshttps://doi.org/10.48550/arxiv.0905.3927openalex-snapshot
SuperNOVA: a novel algorithm for graph automorphism calculations
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0379openalex-snapshot
The Parameterized Complexity of some Permutation Group Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1609.03013openalex-snapshot
Algorithmic Aspects of Regular Graph Covers
inferred← citeshttps://doi.org/10.48550/arxiv.1910.04974openalex-snapshot
A Quality Metric for Symmetric Graph Drawings
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08067openalex-snapshot
Quasi-Equivalence Discovery for Zero-Shot Emergent Communication
inferred← citeshttps://doi.org/10.53555/nnms.v7i11.945openalex-snapshot
The Determination of Graph Isomorphism Using R Software
inferred← citeshttps://doi.org/10.5555/545381.545428openalex-snapshot
Symmetric drawings of triconnected planar graphs
inferred← citeshttps://doi.org/10.5772/intechopen.112232openalex-snapshot
Improving the Relevance, Speed, and Computational Efficiency of Semantic Search through Database Indexing: A Review
inferred← citeshttps://doi.org/10.7155/jgaa.00090openalex-snapshot
Computing and Drawing Isomorphic Subgraphs
inferred← citeshttps://doi.org/10.7939/r3kk94q7vopenalex-snapshot
Error-tolerant Exemplar Queries on Knowledge 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.