On the public citation graph
Similarity Search in Graph Databases: A Multi-Layered Indexing Approach
0 signed · 110 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/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1007/978-1-4419-6045-0openalex-snapshot
Managing and Mining Graph Data
inferredcites →https://doi.org/10.1007/978-3-642-20844-7_11openalex-snapshot
Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching
inferredcites →https://doi.org/10.1007/978-3-642-38221-5_15openalex-snapshot
A Novel Software Toolkit for Graph Edit Distance Computation
inferredcites →https://doi.org/10.1007/s00778-013-0306-1openalex-snapshot
Efficient processing of graph similarity queries with edit distance constraints
inferredcites →https://doi.org/10.1007/s00778-015-0381-6openalex-snapshot
Efficient distributed subgraph similarity matching
inferredcites →https://doi.org/10.1007/s10044-008-0141-yopenalex-snapshot
A survey of graph edit distance
inferredcites →https://doi.org/10.1016/0304-3975(92)90143-4openalex-snapshot
Approximate string-matching with q-grams and maximal matches
inferredcites →https://doi.org/10.1016/j.patrec.2015.02.004openalex-snapshot
An improved global lower bound for graph edit similarity search
inferredcites →https://doi.org/10.1016/s0167-8655(97)00060-3openalex-snapshot
On a relation between graph edit distance and maximum common subgraph
inferredcites →https://doi.org/10.1016/s0167-8655(97)00179-7openalex-snapshot
A graph distance metric based on the maximal common subgraph
inferredcites →https://doi.org/10.1093/bioinformatics/btl571openalex-snapshot
SAGA: a subgraph matching tool for biological graphs
inferredcites →https://doi.org/10.1093/nar/27.1.29openalex-snapshot
KEGG: Kyoto Encyclopedia of Genes and Genomes
inferredcites →https://doi.org/10.1109/34.790431openalex-snapshot
Error correcting graph matching: on the influence of the underlying cost function
inferredcites →https://doi.org/10.1109/34.954600openalex-snapshot
Efficient matching and indexing of graph models in content-based retrieval
inferredcites →https://doi.org/10.1109/icde.2012.28openalex-snapshot
An Efficient Graph Indexing Method
inferredcites →https://doi.org/10.1109/icde.2012.91openalex-snapshot
Efficient Graph Similarity Joins with Edit Distance Constraints
inferredcites →https://doi.org/10.1109/icdm.2002.1184038openalex-snapshot
gSpan: graph-based substructure pattern mining
inferredcites →https://doi.org/10.1109/tkde.2010.28openalex-snapshot
Efficiently Indexing Large Sparse Graphs for Similarity Search
inferredcites →https://doi.org/10.1142/6523openalex-snapshot
Bridging the Gap between Graph Edit Distance and Kernel Machines
inferredcites →https://doi.org/10.1142/9789812770202openalex-snapshot
Bridging the Gap Between Graph Edit Distance and Kernel Machines
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.1145/1066157.1066244openalex-snapshot
Substructure similarity search in graph databases
inferredcites →https://doi.org/10.1145/1807167.1807264openalex-snapshot
Connected substructure similarity search
inferredcites →https://doi.org/10.1145/2247596.2247650openalex-snapshot
Finding top-k similar graphs in graph databases
inferredcites →https://doi.org/10.1145/2505515.2505723openalex-snapshot
Graph similarity search with edit distance constraint in large graph databases
inferredcites →https://doi.org/10.1145/2588555.2610524openalex-snapshot
Answering top-k representative queries on graph databases
inferredcites →https://doi.org/10.14778/2311906.2311907openalex-snapshot
Efficient subgraph matching on billion node graphs
inferredcites →https://doi.org/10.14778/2732232.2732236openalex-snapshot
A partition-based approach to structure similarity search
inferredcites →https://doi.org/10.48550/arxiv.1311.3144openalex-snapshot
Recent Advances in Graph Partitioning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-89657-7_24openalex-snapshot
Metric Indexing for Graph Similarity Search
inferred← citeshttps://doi.org/10.1007/978-3-031-48316-5_42openalex-snapshot
Boosting Similar Compounds Searches via Correlated Subgraph Analysis
inferred← citeshttps://doi.org/10.1007/978-981-15-7981-3_2openalex-snapshot
An Incremental Partitioning Graph Similarity Search Based on Tree Structure Index
inferred← citeshttps://doi.org/10.1007/978-981-95-5716-5_28openalex-snapshot
Towards Efficient Graph Similarity Search in Cloud Environments
inferred← citeshttps://doi.org/10.1007/s00778-022-00731-7openalex-snapshot
Making graphs compact by lossless contraction
inferred← citeshttps://doi.org/10.1007/s10559-019-00213-9openalex-snapshot
Fast Similarity Search for Graphs by Edit Distance
inferred← citeshttps://doi.org/10.1007/s10618-022-00850-3openalex-snapshot
EmbAssi: embedding assignment costs for similarity search in large graph databases
inferred← citeshttps://doi.org/10.1007/s41019-024-00278-3openalex-snapshot
IGFM: An Enhanced Graph Similarity Computation Method with Fine-Grained Analysis
inferred← citeshttps://doi.org/10.1007/s43441-020-00190-8openalex-snapshot
Spatial-Cluster Signal Detection in Medical Devices Using Likelihood Ratio Test Method
inferred← citeshttps://doi.org/10.1016/j.aei.2025.104058openalex-snapshot
Automatic recognition of machining and inspection features based on similarity computation integrated with knowledge graph
inferred← citeshttps://doi.org/10.1016/j.is.2018.10.003openalex-snapshot
A novel edge-centric approach for graph edit similarity computation
inferred← citeshttps://doi.org/10.1016/j.jmsy.2023.02.011openalex-snapshot
An inexact subgraph matching algorithm for subpart retrieval in NC process reuse
inferred← citeshttps://doi.org/10.1016/j.knosys.2018.10.002openalex-snapshot
An efficient algorithm for graph edit distance computation
inferred← citeshttps://doi.org/10.1016/j.neucom.2021.01.068openalex-snapshot
Graph partitioning and graph neural network based hierarchical graph matching for graph similarity computation
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.107070openalex-snapshot
Separating Structure from Noise in Large Graphs Using the Regularity Lemma
inferred← citeshttps://doi.org/10.1088/1742-6596/2759/1/012010openalex-snapshot
Distilling Structural Knowledge for Platform-Aware Semantic Segmentation
inferred← citeshttps://doi.org/10.1109/access.2022.3194559openalex-snapshot
Efficient Top-k Graph Similarity Search With GED Constraints
inferred← citeshttps://doi.org/10.1109/access.2023.3299267openalex-snapshot
Co-Attention Graph Pooling for Efficient Pairwise Graph Interaction Learning
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9377872openalex-snapshot
Inexact Attributed Subgraph Matching
inferred← citeshttps://doi.org/10.1109/csudet47057.2019.9214710openalex-snapshot
GOOSE: An Object-oriented Search Algorithm with Graph-based Database
inferred← citeshttps://doi.org/10.1109/enc53357.2021.9534826openalex-snapshot
Identification of Potential Adverse Drug Reactions using Random Walk on Network Models
inferred← citeshttps://doi.org/10.1109/hpcs48598.2019.9188094openalex-snapshot
End-to-End Learning of Graph Similarity
inferred← citeshttps://doi.org/10.1109/icde.2018.00055openalex-snapshot
An Efficient Probabilistic Approach for Graph Similarity Search
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00074openalex-snapshot
Speeding Up GED Verification for Graph Similarity Search
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00070openalex-snapshot
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00162openalex-snapshot
Wind-Bell Index: Towards Ultra-Fast Edge Query for Graph Databases
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00386openalex-snapshot
Explainable Hyperlink Prediction: A Hypergraph Edit Distance-Based Approach
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00139openalex-snapshot
Unraveling Privacy Risks of Individual Fairness in Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00346openalex-snapshot
FRESH: Towards Efficient Graph Queries in an Outsourced Graph
inferred← citeshttps://doi.org/10.1109/icdew.2019.000-7openalex-snapshot
Efficient Parallel Computing of Graph Edit Distance
inferred← citeshttps://doi.org/10.1109/icist52614.2021.9440632openalex-snapshot
Top-k Graph Similarity Search Based on Hierarchical Inverted Index
inferred← citeshttps://doi.org/10.1109/isaeece66033.2025.11160120openalex-snapshot
Blockchain-Enabled Trustworthy Friend Recommendation via Structural Similarity in Ego Networks
inferred← citeshttps://doi.org/10.1109/tkde.2019.2906608openalex-snapshot
Answering Top-$k$ Graph Similarity Queries in Graph Databases
inferred← citeshttps://doi.org/10.1109/tkde.2019.2954527openalex-snapshot
MSQ-Index: A Succinct Index for Fast Graph Similarity Search
inferred← citeshttps://doi.org/10.1109/tkde.2022.3153523openalex-snapshot
Accelerating Graph Similarity Search via Efficient GED Computation
inferred← citeshttps://doi.org/10.1109/tkde.2023.3253802openalex-snapshot
Learning Region Similarities via Graph-Based Deep Metric Learning
inferred← citeshttps://doi.org/10.1109/tkde.2023.3266449openalex-snapshot
PrigSim: Towards Privacy-Preserving Graph Similarity Search as a Cloud Service
inferred← citeshttps://doi.org/10.1109/tkde.2025.3621493openalex-snapshot
TowerDNA: Fast and Accurate Graph Retrieval With Dividing, Contrasting and Alignment
inferred← citeshttps://doi.org/10.1109/tnse.2023.3236028openalex-snapshot
Structural Equivalence in Subgraph Matching
inferred← citeshttps://doi.org/10.1142/s0218001421510083openalex-snapshot
Upper Bounding Graph Edit Distance Based on Rings and Machine Learning
inferred← citeshttps://doi.org/10.1145/3394486.3403257openalex-snapshot
GHashing: Semantic Graph Hashing for Approximate Similarity Search in Graph Databases
inferred← citeshttps://doi.org/10.1145/3397271.3401216openalex-snapshot
Deep Neural Matching Models for Graph Retrieval
inferred← citeshttps://doi.org/10.1145/3448016.3452780openalex-snapshot
Boosting Graph Similarity Search through Pre-Computation
inferred← citeshttps://doi.org/10.1145/3448016.3452797openalex-snapshot
Making Graphs Compact by Lossless Contraction
inferred← citeshttps://doi.org/10.1145/3498851.3499024openalex-snapshot
A Subgraph Isomorphism-based Attack Towards Social Networks
inferred← citeshttps://doi.org/10.1145/3503047.3503062openalex-snapshot
Research on the Optimal Methods for Graph Edit Distance
inferred← citeshttps://doi.org/10.1145/3539597.3570376openalex-snapshot
Global Counterfactual Explainer for Graph Neural Networks
inferred← citeshttps://doi.org/10.1145/3626772.3657773openalex-snapshot
Grand: A Fast and Accurate Graph Retrieval Framework via Knowledge Distillation
inferred← citeshttps://doi.org/10.1145/3698108openalex-snapshot
GCFExplainer: Global Counterfactual Explainer for Graph Neural Networks
inferred← citeshttps://doi.org/10.1145/3709673openalex-snapshot
Computing Approximate Graph Edit Distance via Optimal Transport
inferred← citeshttps://doi.org/10.1186/s13321-025-01003-6openalex-snapshot
GESim: ultrafast graph-based molecular similarity calculation via von Neumann graph entropy
inferred← citeshttps://doi.org/10.1186/s42400-025-00457-3openalex-snapshot
Privacy-preserving graph similarity search with attribute-based access control
inferred← citeshttps://doi.org/10.14778/3303753.3303756openalex-snapshot
Correlation constraint shortest path over large multi-relation graphs
inferred← citeshttps://doi.org/10.14778/3594512.3594514openalex-snapshot
Computing Graph Edit Distance via Neural Graph Matching
inferred← citeshttps://doi.org/10.14778/3749646.3749648openalex-snapshot
S 3 AND: Efficient Subgraph Similarity Search under Aggregated Neighbor Difference Semantics
inferred← citeshttps://doi.org/10.14778/3797919.3797930openalex-snapshot
A Semantics-Aware Approach for Graph Edit Distance Estimation over Knowledge Graphs
inferred← citeshttps://doi.org/10.24963/ijcai.2019/275openalex-snapshot
Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity
inferred← citeshttps://doi.org/10.3390/a14080225openalex-snapshot
Similar Supergraph Search Based on Graph Edit Distance
inferred← citeshttps://doi.org/10.3390/app12157668openalex-snapshot
Neural Graph Similarity Computation with Contrastive Learning
inferred← citeshttps://doi.org/10.3390/electronics13193794openalex-snapshot
A Graph Similarity Algorithm Based on Graph Partitioning and Attention Mechanism
inferred← citeshttps://doi.org/10.3390/electronics9091348openalex-snapshot
Intelligent Indexing—Boosting Performance in Database Applications by Recognizing Index Patterns
inferred← citeshttps://doi.org/10.3390/s22010003openalex-snapshot
Unsupervised Event Graph Representation and Similarity Learning on Biomedical Literature
inferred← citeshttps://doi.org/10.48550/arxiv.1808.05689openalex-snapshot
SimGNN: A Neural Network Approach to Fast Graph Similarity Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1909.07420openalex-snapshot
Regular Partitions and Their Use in Structural Pattern Recognition
inferred← citeshttps://doi.org/10.48550/arxiv.2002.03427openalex-snapshot
Graph Neural Distance Metric Learning with Graph-Bert
inferred← citeshttps://doi.org/10.48550/arxiv.2004.01124openalex-snapshot
Nass: A New Approach to Graph Similarity Search
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.