On the public citation graph
Substructure, Subgraph, and Walk Counts as Measures of the Complexity of Graphs and Molecules
0 signed · 51 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/0004-3702(85)90048-7openalex-snapshot
Artificial intelligence applications in chemistry
inferredcites →https://doi.org/10.1016/s1093-3263(01)00101-2openalex-snapshot
Overall connectivity — a next generation molecular connectivity
inferredcites →https://doi.org/10.1021/ci00003a600openalex-snapshot
Computer Software Reviews. RISKPRO: Environmental Pollution Modeling System
inferredcites →https://doi.org/10.1021/ci000145popenalex-snapshot
A New and Simple Approach to Chemical Complexity. Application to the Synthesis of Natural Products
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/ci0100245openalex-snapshot
On Finding Nonisomorphic Connected Subgraphs and Distinct Molecular Substructures [J. Chem. Inf. Comput. Sci. 41, 314−320 (2001)]
inferredcites →https://doi.org/10.1021/ci9900579openalex-snapshot
Walk Counts, Labyrinthicity, and Complexity of Acyclic and Cyclic Graphs and Molecules
inferredcites →https://doi.org/10.1021/ci990120uopenalex-snapshot
Overall Connectivities/Topological Complexities: A New Powerful Tool for QSPR/QSAR
inferredcites →https://doi.org/10.1021/jo9814546openalex-snapshot
On the Structure of Total Synthesis of Complex Natural Products
inferredcites →https://doi.org/10.1055/s-1994-25493openalex-snapshot
Organic Synthesis - Theory and Applications
inferredcites →https://doi.org/10.1080/10629369708039123openalex-snapshot
Novel Indices for the Topological Complexity of Molecules
inferredcites →https://doi.org/10.1201/9781482296945openalex-snapshot
Topological Indices and Related Descriptors in QSAR and QSPR
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9783527645121.ch15openalex-snapshot
Generation of Chemical Transformations: Reaction Pathways Prediction and Synthesis Design
inferred← citeshttps://doi.org/10.1002/chin.200208274openalex-snapshot
ChemInform Abstract: Substructure, Subgraph, and Walk Counts as Measures of the Complexity of Graphs and Molecules.
inferred← citeshttps://doi.org/10.1002/qua.10343openalex-snapshot
Characterization of molecular complexity
inferred← citeshttps://doi.org/10.1007/0-387-25871-x_1openalex-snapshot
On the Complexity of Fullerenes and Nanotubes
inferred← citeshttps://doi.org/10.1007/0-387-25871-x_5openalex-snapshot
Quantitative Measures of Network Complexity
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_285openalex-snapshot
Information Theoretic Complexity Measures
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_554openalex-snapshot
Topological Complexity of Molecules
inferred← citeshttps://doi.org/10.1007/978-1-59259-414-6_31openalex-snapshot
Complexity of Protein-Protein Interaction Networks, Complexes, and Pathways
inferred← citeshttps://doi.org/10.1007/978-3-642-17635-7_4openalex-snapshot
Complexity and Diversity of Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_554-2openalex-snapshot
Topological Complexity of Molecules
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_554-3openalex-snapshot
Topological Complexity of Molecules
inferred← citeshttps://doi.org/10.1007/s00778-017-0459-4openalex-snapshot
Scalable subgraph enumeration in MapReduce: a cost-oriented approach
inferred← citeshttps://doi.org/10.1007/s00894-003-0126-0openalex-snapshot
The compressed feature matrix?a fast method for feature based substructure search
inferred← citeshttps://doi.org/10.1007/s10822-005-9008-0openalex-snapshot
Substructural fragments: an universal language to encode reactions, molecular and supramolecular structures
inferred← citeshttps://doi.org/10.1007/springerreference_60457openalex-snapshot
Information Theoretic Complexity Measures
inferred← citeshttps://doi.org/10.1007/springerreference_60726openalex-snapshot
Topological Complexity of Molecules
inferred← citeshttps://doi.org/10.1016/b978-1-68108-198-4.50003-5openalex-snapshot
On the Concept for Overall Topological Representation of Molecular Structure
inferred← citeshttps://doi.org/10.1016/j.biosystems.2013.02.006openalex-snapshot
The Rücker–Markov invariants of complex Bio-Systems: Applications in Parasitology and Neuroinformatics
inferred← citeshttps://doi.org/10.1021/acs.jcim.5b00723openalex-snapshot
An Additive Definition of Molecular Complexity
inferred← citeshttps://doi.org/10.1021/acs.jmedchem.3c01507openalex-snapshot
Molecular Complexity: You Know It When You See It
inferred← citeshttps://doi.org/10.1021/ci034256aopenalex-snapshot
Representation of the Molecular Topology of Cyclical Structures by Means of Cycle Graphs. 1. Extraction of Topological Properties
inferred← citeshttps://doi.org/10.1021/ci040100eopenalex-snapshot
Random Walks and Chemical Graph Theory
inferred← citeshttps://doi.org/10.1021/ci100146nopenalex-snapshot
Search for Complexity Generating Chemical Transformations by Combining Connectivity Analysis and Cascade Transformation Patterns
inferred← citeshttps://doi.org/10.1021/ci7000617openalex-snapshot
From Molecular to Biological Structure and Back
inferred← citeshttps://doi.org/10.1038/s41570-024-00645-8openalex-snapshot
Molecular complexity as a driving force for the advancement of organic synthesis
inferred← citeshttps://doi.org/10.1039/b210843gopenalex-snapshot
Complexity of synthetic reactions. The use of complexity indices to evaluate reactions, transforms and disconnections1Electronic supplementary information (ESI) available: a Prolegomenon to chemical graph theory; Table 13 and Figure 1, summarizing all possible disconnections of azacyclohexane 28.…
inferred← citeshttps://doi.org/10.1080/1062936031000101764openalex-snapshot
On the complexity of directed biological networks
inferred← citeshttps://doi.org/10.1145/3627673.3679628openalex-snapshot
MOAT: Graph Prompting for 3D Molecular Graphs
inferred← citeshttps://doi.org/10.1201/b18389openalex-snapshot
Graph-Theoretical Matrices in Chemistry
inferred← citeshttps://doi.org/10.1201/b18389-3openalex-snapshot
The Adjacency Matrix and Related Matrices
inferred← citeshttps://doi.org/10.14778/2794367.2794368openalex-snapshot
Scalable subgraph enumeration in MapReduce
inferred← citeshttps://doi.org/10.14778/3021924.3021937openalex-snapshot
Scalable distributed subgraph enumeration
inferred← citeshttps://doi.org/10.2174/1574893610666151008013413openalex-snapshot
MI-NODES Multiscale Models of Metabolic Reactions, Brain Connectome, Ecological, Epidemic, World Trade, and Legal-Social Networks
inferred← citeshttps://doi.org/10.25904/1912/3710openalex-snapshot
Speeding up Subgraph Isomorphism Search in Large Graphs
inferred← citeshttps://doi.org/10.2751/jcac.10.104openalex-snapshot
Selective Search Focusing on Retro-Synthetically Important Bonds in A Synthesis Design System
inferred← citeshttps://doi.org/10.32744/pse.2024.3.37openalex-snapshot
A model for estimating the visual complexity of a molecule using graph theory metrics: an educational perspective
inferred← citeshttps://doi.org/10.48550/arxiv.2111.03227openalex-snapshot
SPECTRe: Substructure Processing, Enumeration, and Comparison Tool Resource: An efficient tool to encode all substructures of molecules represented in SMILES
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.