On the public citation graph
Isomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs
0 signed · 97 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/jcc.540060606openalex-snapshot
Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). I. Algorithms for finding graph orbits and canonical numbering of atoms
inferredcites →https://doi.org/10.1007/3-540-11493-9openalex-snapshot
Group-Theoretic Algorithms and Graph Isomorphism
inferredcites →https://doi.org/10.1007/978-1-4612-0333-9openalex-snapshot
The Graph Isomorphism Problem
inferredcites →https://doi.org/10.1007/bf00552670openalex-snapshot
Extended connectivity in chemical graphs
inferredcites →https://doi.org/10.1016/0022-0000(79)90043-6openalex-snapshot
Graph isomorphism, general remarks
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/0098-1354(94)00009-dopenalex-snapshot
Computer generated reaction modelling: Decomposition and encoding algorithms for determining species uniqueness
inferredcites →https://doi.org/10.1016/0196-6774(90)90013-5openalex-snapshot
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
inferredcites →https://doi.org/10.1021/c160017a018openalex-snapshot
The Generation of a Unique Machine Description for Chemical Structures-A Technique Developed at Chemical Abstracts Service.
inferredcites →https://doi.org/10.1021/c160017a019openalex-snapshot
A Connectivity Code for Use in Describing Chemical Structures.
inferredcites →https://doi.org/10.1021/ci00001a022openalex-snapshot
On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs
inferredcites →https://doi.org/10.1021/ci00066a017openalex-snapshot
Computer perception of constitutional (topological) symmetry: TOPSYM, a fast algorithm for partitioning atoms and pairwise relations among atoms into equivalence classes
inferredcites →https://doi.org/10.1021/ci00066a018openalex-snapshot
Substructure search systems. 1. Performance comparison of the MACCS, DARC, HTSS, CAS Registry MVSSS, and S4 substructure search systems
inferredcites →https://doi.org/10.1021/ci00067a009openalex-snapshot
Computational techniques for vertex partitioning of graphs
inferredcites →https://doi.org/10.1021/ci60010a013openalex-snapshot
Computer Perception of Topological Symmetry
inferredcites →https://doi.org/10.1021/ci60010a014openalex-snapshot
Canonical Numbering and Constitutional Symmetry
inferredcites →https://doi.org/10.1021/ci60014a015openalex-snapshot
Erroneous Claims Concerning the Perception of Topological Symmetry
inferredcites →https://doi.org/10.1021/ci60014a016openalex-snapshot
Computer Design of Synthesis in Phosphorus Chemistry: Automatic Treatment of Stereochemistry
inferredcites →https://doi.org/10.1021/ci60020a015openalex-snapshot
An Approach to the Assignment of Canonical Connection Tables and Topological Symmetry Perception
inferredcites →https://doi.org/10.1021/ci9500593openalex-snapshot
Determination of Topological Equivalence Classes of Atoms and Bonds in C20−C60 Fullerenes Using a New Prolog Coding Program
inferredcites →https://doi.org/10.1021/ci9501711openalex-snapshot
Detection of Constitutionally Equivalent Sites from a Connection Table
inferredcites →https://doi.org/10.1021/ja00822a021openalex-snapshot
Stereochemically unique naming algorithm
inferredcites →https://doi.org/10.1109/sfcs.1979.8openalex-snapshot
Canonical labelling of graphs in linear average time
inferredcites →https://doi.org/10.1137/s0895480191196769openalex-snapshot
A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470845015.cca001openalex-snapshot
Canonical Numbering and Constitutional Symmetry
inferred← citeshttps://doi.org/10.1002/9781118131411.ch6openalex-snapshot
Graphs: Flexible Representations of Molecular Structures and Biological Networks
inferred← citeshttps://doi.org/10.1002/9783527618279.ch7aopenalex-snapshot
Canonical Numbering and Constitutional Symmetry
inferred← citeshttps://doi.org/10.1002/9783527816880.ch3openalex-snapshot
Computer Processing of Chemical Structure Information
inferred← citeshttps://doi.org/10.1002/cplx.20074openalex-snapshot
Rule‐based modeling of biochemical networks
inferred← citeshttps://doi.org/10.1002/kin.20749openalex-snapshot
RCARM: Reaction classification using automated reaction mapping
inferred← citeshttps://doi.org/10.1007/11905455_5openalex-snapshot
Graph Theory for Rule-Based Modeling of Biochemical Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-76787-7_10openalex-snapshot
Labeled Graphs in Life Sciences—Two Important Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-24624-4_11openalex-snapshot
Resilient Information Hiding for Abstract Semi-structures
inferred← citeshttps://doi.org/10.1007/978-3-540-25967-1_8openalex-snapshot
Retrieval by Structure from Chemical Data Bases
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_8openalex-snapshot
The Potential of a Chemical Graph Transformation System
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_27openalex-snapshot
Novel Techniques for Automorphism Group Computation
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/s10601-018-9294-5openalex-snapshot
Constraints for symmetry breaking in graph representation
inferred← citeshttps://doi.org/10.1007/s10822-005-9010-6openalex-snapshot
Can topological indices transmit information on properties but not on structures?
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.jssc.2005.06.011openalex-snapshot
Crystal nets as graphs: Terminology and definitions
inferred← citeshttps://doi.org/10.1016/j.matpr.2020.09.371openalex-snapshot
WITHDRAWN: Application of graph labeling in crystallography
inferred← citeshttps://doi.org/10.1021/acs.jcim.5b00543openalex-snapshot
Get Your Atoms in Order—An Open-Source Implementation of a Novel and Robust Molecular Canonicalization Algorithm
inferred← citeshttps://doi.org/10.1021/acs.jcim.5c01964openalex-snapshot
Rapid Exploration of the Assembly Chemical Space of Molecular Graphs
inferred← citeshttps://doi.org/10.1021/acs.jcim.6b00546openalex-snapshot
ArbAlign: A Tool for Optimal Alignment of Arbitrarily Ordered Isomers Using the Kuhn–Munkres Algorithm
inferred← citeshttps://doi.org/10.1021/ci000029mopenalex-snapshot
Stochastic Generator of Chemical Structure. 3. Reaction Network Generation
inferred← citeshttps://doi.org/10.1021/ci000407nopenalex-snapshot
SENECA: A Platform-Independent, Distributed, and Parallel System for Computer-Assisted Structure Elucidation in Organic Chemistry
inferred← citeshttps://doi.org/10.1021/ci020343bopenalex-snapshot
Encoding of Polycyclic Si-Containing Molecules for Determining Species Uniqueness in Automated Mechanism Generation
inferred← citeshttps://doi.org/10.1021/ci020345wopenalex-snapshot
The Signature Molecular Descriptor. 1. Using Extended Valence Sequences in QSAR and QSPR Studies
inferred← citeshttps://doi.org/10.1021/ci020346oopenalex-snapshot
The Signature Molecular Descriptor. 2. Enumerating Molecules from Their Extended Valence Sequences
inferred← citeshttps://doi.org/10.1021/ci0341363openalex-snapshot
NMRShiftDBConstructing a Free Chemical Information System with Open-Source Components
inferred← citeshttps://doi.org/10.1021/ci0341823openalex-snapshot
The Signature Molecular Descriptor. 4. Canonizing Molecules Using Extended Valence Sequences
inferred← citeshttps://doi.org/10.1021/ci049966aopenalex-snapshot
Identification of Symmetries in Molecules and Complexes
inferred← citeshttps://doi.org/10.1021/ci200330xopenalex-snapshot
Handling of Tautomerism and Stereochemistry in Compound Registration
inferred← citeshttps://doi.org/10.1021/ci4005173openalex-snapshot
“Social” Network of Isomers Based on Bond Count Distance: Algorithms
inferred← citeshttps://doi.org/10.1021/ci500314aopenalex-snapshot
Computational Derivation of Structural Alerts from Large Toxicology Data Sets
inferred← citeshttps://doi.org/10.1021/ci5003922openalex-snapshot
CLCA: Maximum Common Molecular Substructure Queries within the MetRxn Database
inferred← citeshttps://doi.org/10.1021/ci600238jopenalex-snapshot
Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information
inferred← citeshttps://doi.org/10.1021/ci9801522openalex-snapshot
Isomer Generation: Syntactic Rules for Detection of Isomorphism
inferred← citeshttps://doi.org/10.1021/ci980155eopenalex-snapshot
Comment on “Isomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs”
inferred← citeshttps://doi.org/10.1021/ci990085ropenalex-snapshot
Isomer Generation: Semantic Rules for Detection of Isomorphism
inferred← citeshttps://doi.org/10.1088/2632-2153/adea0bopenalex-snapshot
Atomic orbits in molecules and materials for improving machine learning force fields
inferred← citeshttps://doi.org/10.1093/comjnl/45.6.631openalex-snapshot
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
inferred← citeshttps://doi.org/10.1103/physreve.76.036107openalex-snapshot
Graph animals, subgraph sampling, and motif search in large networks
inferred← citeshttps://doi.org/10.1109/bracis.2014.41openalex-snapshot
Syntactic Compression of Description Logics Terminologies
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.11234/gi1990.9.284openalex-snapshot
Automated Metabolic Reconstruction at the Molecular Level
inferred← citeshttps://doi.org/10.1142/s0129054115500161openalex-snapshot
Random Models and Analyses for Chemical Graphs
inferred← citeshttps://doi.org/10.1145/1066677.1066712openalex-snapshot
Graphical rule-based representation of signal-transduction networks
inferred← citeshttps://doi.org/10.1145/2532569openalex-snapshot
Faster reaction mapping through improved naming techniques
inferred← citeshttps://doi.org/10.1145/3374213openalex-snapshot
Secure Assay Execution on MEDA Biochips to Thwart Attacks Using Real-Time Sensing
inferred← citeshttps://doi.org/10.1155/2014/934637openalex-snapshot
Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph
inferred← citeshttps://doi.org/10.1186/1758-2946-6-31openalex-snapshot
Efficient enumeration of monocyclic chemical graphs with given path frequencies
inferred← citeshttps://doi.org/10.1186/s13321-020-00453-4openalex-snapshot
Atomic ring invariant and Modified CANON extended connectivity algorithm for symmetry perception in molecular graphs and rigorous canonicalization of SMILES
inferred← citeshttps://doi.org/10.1186/s13321-020-00480-1openalex-snapshot
MET: a Java package for fast molecule equivalence testing
inferred← citeshttps://doi.org/10.1186/s13321-023-00692-1openalex-snapshot
Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions
inferred← citeshttps://doi.org/10.12794/metadc12076openalex-snapshot
An investigation into graph isomorphism based zero-knowledge proofs.
inferred← citeshttps://doi.org/10.4230/lipics.esa.2017.60openalex-snapshot
Benchmark Graphs for Practical Graph Isomorphism
inferred← citeshttps://doi.org/10.48456/tr-903openalex-snapshot
Parameterized complexity of distances to sparse graph classes
inferred← citeshttps://doi.org/10.48550/arxiv.1007.1726openalex-snapshot
Vsep-New Heuristic and Exact Algorithms for Graph Automorphism Group Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1106.4489openalex-snapshot
Fast Isomorphism Testing of Graphs with Regularly-Connected Components
inferred← citeshttps://doi.org/10.48550/arxiv.2011.11839openalex-snapshot
Structural Equivalence in Graphs and Complete Skeletons
inferred← citeshttps://doi.org/10.5936/csbj.201302004openalex-snapshot
COMPARISON AND ENUMERATION OF CHEMICAL GRAPHS
inferred← citeshttps://doi.org/10.6084/m9.figshare.26570662openalex-snapshot
Additional file 1 of Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions
inferred← citeshttps://doi.org/10.6084/m9.figshare.26570665openalex-snapshot
Additional file 2 of Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions
inferred← citeshttps://doi.org/10.6084/m9.figshare.26570671openalex-snapshot
Additional file 3 of Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions
inferred← citeshttps://doi.org/10.6084/m9.figshare.26570674openalex-snapshot
Additional file 4 of Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions
inferred← citeshttps://doi.org/10.6084/m9.figshare.26570677openalex-snapshot
Additional file 5 of Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions
inferred← citeshttps://doi.org/10.6084/m9.figshare.26570680openalex-snapshot
Additional file 6 of Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions
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.