On the public citation graph

Matching graphs with unique node labels

https://doi.org/10.1007/bf02683991
0 signed · 112 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/spe.4380120103openalex-snapshot
Backtrack search algorithms and the maximal common subgraph problem
inferredcites →https://doi.org/10.1007/3-540-45028-9_2openalex-snapshot
On Graphs with Unique Node Labels
inferredcites →https://doi.org/10.1007/3-540-45129-3_6openalex-snapshot
A Unified Framework for Indexing and Matching Hierarchical Shape Structures
inferredcites →https://doi.org/10.1007/3-540-61577-6_12openalex-snapshot
Including geometry in graph representations: A quadratic-time graph isomorphism algorithm and its applications
inferredcites →https://doi.org/10.1007/3-540-61577-6_16openalex-snapshot
Inexact graph matching with genetic search
inferredcites →https://doi.org/10.1007/3-540-70659-3_13openalex-snapshot
Inexact Multisubgraph Matching Using Graph Eigenspace and Clustering Models
inferredcites →https://doi.org/10.1007/3-540-70659-3_8openalex-snapshot
Spectral Feature Vectors for Graph Clustering
inferredcites →https://doi.org/10.1007/bf02575586openalex-snapshot
A note on the derivation of maximal common subgraphs of two directed or undirected graphs
inferredcites →https://doi.org/10.1007/pl00012580openalex-snapshot
Connected Components in Random Graphs with Given Expected Degree Sequences
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/s0031-3203(96)00123-9openalex-snapshot
Inexact graph matching using genetic search
inferredcites →https://doi.org/10.1017/s0960129501003577openalex-snapshot
Constraint satisfaction algorithms for graph pattern matching
inferredcites →https://doi.org/10.1023/a:1018774912261openalex-snapshot
Empirical Evidence of Reliability Growth In Large-Scale Networks
inferredcites →https://doi.org/10.1109/34.400565openalex-snapshot
Structural matching in computer vision using probabilistic relaxation
inferredcites →https://doi.org/10.1109/34.601251openalex-snapshot
Structural matching by discrete relaxation
inferredcites →https://doi.org/10.1109/34.682179openalex-snapshot
A new algorithm for error-tolerant subgraph isomorphism detection
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.954602openalex-snapshot
Structural graph matching using the EM algorithm and singular value decomposition
inferredcites →https://doi.org/10.1109/34.954604openalex-snapshot
An median graphs: properties, algorithms, and applications
inferredcites →https://doi.org/10.1109/3477.604100openalex-snapshot
Genetic-based search for error-correcting graph isomorphism
inferredcites →https://doi.org/10.1109/icdar.2003.1227666openalex-snapshot
Classification of Web documents using a graph model
inferredcites →https://doi.org/10.1109/idc.2002.995365openalex-snapshot
Measuring change in large enterprise data networks
inferredcites →https://doi.org/10.1109/tpami.2001.954597openalex-snapshot
Introduction to the special section on graph algorithms in computer vision
inferredcites →https://doi.org/10.1109/tpami.2002.1046176openalex-snapshot
Matching free trees, maximal cliques, and monotone game dynamics
inferredcites →https://doi.org/10.1109/tsmc.1983.6313167openalex-snapshot
A distance measure between attributed relational graphs for pattern recognition
inferredcites →https://doi.org/10.1126/science.277.5325.535openalex-snapshot
Social Dilemmas and Internet Congestion
inferredcites →https://doi.org/10.1142/9789812775375openalex-snapshot
Web Document Analysis - Challenges and Opportunities
inferredcites →https://doi.org/10.1142/9789812775375_0001openalex-snapshot
CLUSTERING OF WEB DOCUMENTS USING A GRAPH MODEL
inferredcites →https://doi.org/10.1142/s0218001404003241openalex-snapshot
CLASSIFICATION OF WEB DOCUMENTS USING GRAPH MATCHING
inferredcites →https://doi.org/10.1142/s0219265902000562openalex-snapshot
DETECTION OF ABNORMAL CHANGE IN A TIME SERIES OF GRAPHS
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.1145/633025.633040openalex-snapshot
Network topology generators
inferredcites →https://doi.org/10.1145/800119.803896openalex-snapshot
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9783527622818.ch10openalex-snapshot
Detecting Pathological Pathways of a Complex Disease by a Comparative Analysis of Networks
inferred← citeshttps://doi.org/10.1002/9783527627981.ch6openalex-snapshot
Graph Edit Distance – Optimal and Suboptimal Algorithms with Applications
inferred← citeshttps://doi.org/10.1002/tee.23355openalex-snapshot
Attributed Graph Matching via Seeds Guiding
inferred← citeshttps://doi.org/10.1007/11492542_13openalex-snapshot
Comparison of Two Different Prediction Schemes for the Analysis of Time Series of Graphs
inferred← citeshttps://doi.org/10.1007/11510888_36openalex-snapshot
Analysis of Time Series of Graphs: Prediction of Node Presence by Means of Decision Tree Learning
inferred← citeshttps://doi.org/10.1007/11790853_45openalex-snapshot
Computer Network Monitoring and Abnormal Event Detection Using Graph Matching and Multidimensional Scaling
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_1openalex-snapshot
A Brief Introduction to Complex Networks and Their Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_7openalex-snapshot
Exact and Inexact Graph Matching: Methodology and Applications
inferred← citeshttps://doi.org/10.1007/978-1-84628-172-3_10openalex-snapshot
Polynomial Time Complexity Graph Distance Computation for Web Content Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-11656-3_11openalex-snapshot
Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-18224-7_15openalex-snapshot
Improving Hausdorff Edit Distance Using Structural Node Context
inferred← citeshttps://doi.org/10.1007/978-3-319-18224-7_2openalex-snapshot
Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-27252-8_1openalex-snapshot
Introduction and Basic Concepts
inferred← citeshttps://doi.org/10.1007/978-3-319-58961-9_20openalex-snapshot
Improved Graph Edit Distance Approximation with Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-3-319-58961-9_22openalex-snapshot
A Survey on Applications of Bipartite Graph Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-540-31988-7_30openalex-snapshot
Recovery of Missing Information in Graph Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-68020-8_10openalex-snapshot
Clustering of Web Documents Using Graph Representations
inferred← citeshttps://doi.org/10.1007/978-3-540-68020-8_9openalex-snapshot
Graph Sequence Visualisation and its Application to Computer Network Monitoring and Abnormal Event Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-02124-4_13openalex-snapshot
Efficient Suboptimal Graph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-34166-3_12openalex-snapshot
On the Relation between the Common Labelling and the Median Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-38221-5_1openalex-snapshot
A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years
inferred← citeshttps://doi.org/10.1007/978-3-642-53856-8_64openalex-snapshot
Delta Analysis of Role-Based Access Control Models
inferred← citeshttps://doi.org/10.1007/978-3-662-44415-3_9openalex-snapshot
A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance
inferred← citeshttps://doi.org/10.1007/978-81-322-2529-4_33openalex-snapshot
Extending Attack Graph-Based Metrics for Enterprise Network Security Management
inferred← citeshttps://doi.org/10.1007/s10044-008-0105-2openalex-snapshot
Model-based classification with dissimilarities: a maximum likelihood approach
inferred← citeshttps://doi.org/10.1007/s10115-015-0844-5openalex-snapshot
Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks
inferred← citeshttps://doi.org/10.1007/s10115-015-0874-zopenalex-snapshot
Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks
inferred← citeshttps://doi.org/10.1007/s10515-007-0023-3openalex-snapshot
Differencing and merging of architectural views
inferred← citeshttps://doi.org/10.1007/s11036-017-0914-xopenalex-snapshot
Influence of Krylov subspace in Graph Isomorphism for Mobile Networks
inferred← citeshttps://doi.org/10.1016/j.amc.2007.05.058openalex-snapshot
A comparative analysis of multidimensional features of objects resembling sets of graphs
inferred← citeshttps://doi.org/10.1016/j.bbi.2010.04.012openalex-snapshot
A formal analysis of cytokine networks in Chronic Fatigue Syndrome
inferred← citeshttps://doi.org/10.1016/j.cose.2016.09.010openalex-snapshot
Graph similarity metrics for assessing temporal changes in attack surface of dynamic networks
inferred← citeshttps://doi.org/10.1016/j.cviu.2010.12.014openalex-snapshot
Graph-based markerless registration of city maps using geometric hashing
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.129114openalex-snapshot
ERI-Query graph miner: an algorithm to detect edge relaxed induced query graph in large dynamic communication networks
inferred← citeshttps://doi.org/10.1016/j.imavis.2015.06.005openalex-snapshot
Computation of graph edit distance: Reasoning about optimality and speed-up
inferred← citeshttps://doi.org/10.1016/j.ins.2016.01.074openalex-snapshot
Fifty years of graph matching, network alignment and network comparison
inferred← citeshttps://doi.org/10.1016/j.ins.2017.03.036openalex-snapshot
A comparative analysis of new graph distance measures and graph edit distance
inferred← citeshttps://doi.org/10.1016/j.ipm.2019.03.008openalex-snapshot
Unsupervised graph-based rank aggregation for improved retrieval
inferred← citeshttps://doi.org/10.1016/j.patcog.2005.10.011openalex-snapshot
Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning
inferred← citeshttps://doi.org/10.1016/j.patcog.2010.05.016openalex-snapshot
Improving vector space embedding of graphs through feature selection algorithms
inferred← citeshttps://doi.org/10.1016/j.patcog.2012.11.020openalex-snapshot
Discriminative prototype selection methods for graph embedding
inferred← citeshttps://doi.org/10.1016/j.patcog.2014.07.015openalex-snapshot
Approximation of graph edit distance based on Hausdorff matching
inferred← citeshttps://doi.org/10.1016/j.patrec.2011.08.012openalex-snapshot
Pattern analysis with graphs: Parallel work at Bern and York
inferred← citeshttps://doi.org/10.1016/j.patrec.2012.03.017openalex-snapshot
Feature selection on node statistics based embedding of graphs
inferred← citeshttps://doi.org/10.1016/j.ygeno.2008.08.008openalex-snapshot
Neuroendocrine and immune network re-modeling in chronic fatigue syndrome: An exploratory analysis
inferred← citeshttps://doi.org/10.1049/iet-syb.2010.0025openalex-snapshot
Networks for systems biology: conceptual connection of data and function
inferred← citeshttps://doi.org/10.1080/08957340802558367openalex-snapshot
Using a Taxonomy of Differential Step Functioning to Improve the Interpretation of DIF in Polytomous Items: An Illustration
inferred← citeshttps://doi.org/10.1109/ase.2006.33openalex-snapshot
Differencing and Merging of Architectural Views
inferred← citeshttps://doi.org/10.1109/bibmw.2011.6112417openalex-snapshot
VeNet: A framework for the analysis of protein interaction networks through vector space embedding
inferred← citeshttps://doi.org/10.1109/comsnets.2016.7439954openalex-snapshot
An algorithm to search edge relaxed query graph with minimum support threshold in large communication networks
inferred← citeshttps://doi.org/10.1109/das.2016.29openalex-snapshot
Creating Ground Truth for Historical Manuscripts with Document Graphs and Scribbling Interaction
inferred← citeshttps://doi.org/10.1109/icpr.2010.227openalex-snapshot
Vector Space Embedding of Undirected Graphs with Fixed-cardinality Vertex Sequences for Classification
inferred← citeshttps://doi.org/10.1109/icsec47112.2019.8974713openalex-snapshot
A Modified Graph Representation for Room Layout Matching using Spectral Embedding
inferred← citeshttps://doi.org/10.1109/msp.2012.2233865openalex-snapshot
Machine Learning with Brain Graphs: Predictive Modeling Approaches for Functional Imaging in Systems Neuroscience
inferred← citeshttps://doi.org/10.1109/prni.2011.18openalex-snapshot
Classifying Connectivity Graphs Using Graph and Vertex Attributes
inferred← citeshttps://doi.org/10.1109/thms.2016.2634920openalex-snapshot
A User-Centered Segmentation Method for Complex Historical Manuscripts Based on Document Graphs
inferred← citeshttps://doi.org/10.1109/wbd.2010.15openalex-snapshot
Low-Dimensional Embedding of Functional Connectivity Graphs for Brain State Decoding
inferred← citeshttps://doi.org/10.1111/jnc.14800openalex-snapshot
Astrocyte‐specific transcriptome analysis using the ALDH1L1 bacTRAP mouse reveals novel biomarkers of astrogliosis in response to neurotoxicity
inferred← citeshttps://doi.org/10.1142/9789814273398_0003openalex-snapshot
ON DISSIMILARITY EMBEDDING OF GRAPHS IN VECTOR SPACES
inferred← citeshttps://doi.org/10.1142/s0218001412500139openalex-snapshot
SUBOPTIMAL GRAPH ISOMORPHISM USING BIPARTITE MATCHING
inferred← citeshttps://doi.org/10.1142/s0218001414500013openalex-snapshot
GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS
inferred← citeshttps://doi.org/10.1142/s0218001415500111openalex-snapshot
Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations
inferred← citeshttps://doi.org/10.1145/2613087.2613105openalex-snapshot
Anomaly detection and visualization in generative RBAC models
inferred← citeshttps://doi.org/10.1201/b17645-2openalex-snapshot
What Is Quantitative Graph Theory?
inferred← citeshttps://doi.org/10.1371/journal.pone.0022843openalex-snapshot
Integrative Network Biology: Graph Prototyping for Co-Expression Cancer Networks
inferred← citeshttps://doi.org/10.1371/journal.pone.0119309openalex-snapshot
The Complexity of Crime Network Data: A Case Study of Its Consequences for Crime Control and the Study of Networks
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2358785/v1openalex-snapshot
A general approach for of schema matching problem: case of databases
inferred← citeshttps://doi.org/10.21914/anziamj.v48i0.62openalex-snapshot
Detecting changes in time series of network graphs using minimum mean squared error and cumulative summation
inferred← citeshttps://doi.org/10.26481/dis.20240624dsopenalex-snapshot
Symphonies of metabolomics
inferred← citeshttps://doi.org/10.3389/fgene.2021.695399openalex-snapshot
Comparative Analyses of Gene Co-expression Networks: Implementations and Applications in the Study of Evolution
inferred← citeshttps://doi.org/10.3389/fphys.2020.00358openalex-snapshot
Leveraging Prior Knowledge to Recover Characteristic Immune Regulatory Motifs in Gulf War Illness
inferred← citeshttps://doi.org/10.4018/978-1-61350-053-8.ch005openalex-snapshot
Efficient Techniques for Graph Searching and Biological Network Mining
inferred← citeshttps://doi.org/10.48550/arxiv.1912.10314openalex-snapshot
Multimodal Prediction based on Graph Representations
inferred← citeshttps://doi.org/10.48550/arxiv.2012.15279openalex-snapshot
Some Algorithms on Exact, Approximate and Error-Tolerant Graph Matching
inferred← citeshttps://doi.org/10.58837/chula.the.2019.19openalex-snapshot
Graph representation for room layout matching using spectral embedding
inferred← citeshttps://doi.org/10.70675/91aa1991zb8c8z4910z834cz672d31a2b86eopenalex-snapshot
Search and Aggregation in Big Graphs
inferred← citeshttps://doi.org/10.70675/9517dc86zf255z4166z8f26z4195a663764dopenalex-snapshot
Historical document image analysis : a structural approach based on texture
inferred← citeshttps://doi.org/10.70675/96a7814czced9z4f31z9551zdf399ba8b52fopenalex-snapshot
Deep learning onto graph space : application to image-based insect recognition
inferred← citeshttps://doi.org/10.70675/c22fb9a3zf656z4df3z9ed6ze516cc0795fbopenalex-snapshot
Inexact graph matching : application to 2D and 3D Pattern Recognition
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.