On the public citation graph
Error-tolerant graph matching: A formal framework and algorithms
0 signed · 73 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/spe.4380120103openalex-snapshot
Backtrack search algorithms and the maximal common subgraph problem
inferredcites →https://doi.org/10.1007/3-540-52255-7_36openalex-snapshot
Improved simulated annealing, Boltzmann machine, and attributed graph matching
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/978-3-7091-6487-7_5openalex-snapshot
Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs
inferredcites →https://doi.org/10.1007/978-3-7091-6487-7_6openalex-snapshot
Efficient Graph Matching for Video Indexing
inferredcites →https://doi.org/10.1007/bf02526038openalex-snapshot
Classes of cost functions for string edit distance
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/bfb0015562openalex-snapshot
Genetic search for structural matching
inferredcites →https://doi.org/10.1016/b978-0-444-81892-8.50019-5openalex-snapshot
Graph matching by discrete relaxation
inferredcites →https://doi.org/10.1016/b978-0-444-81892-8.50020-1openalex-snapshot
Inexact matching using neural networks
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.1109/34.400565openalex-snapshot
Structural matching in computer vision using probabilistic 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/3477.537320openalex-snapshot
Neural network approach for solving the maximal common subgraph problem
inferredcites →https://doi.org/10.1109/3477.604100openalex-snapshot
Genetic-based search for error-correcting graph isomorphism
inferredcites →https://doi.org/10.1109/icdar.1997.619849openalex-snapshot
Automatic knowledge acquisition for spatial document interpretation
inferredcites →https://doi.org/10.1109/icpr.1994.576921openalex-snapshot
The approximate graph matching problem
inferredcites →https://doi.org/10.1109/proc.1981.12145openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1109/tpami.1981.4767144openalex-snapshot
Structural Descriptions and Inexact Matching
inferredcites →https://doi.org/10.1109/tsmc.1979.4310127openalex-snapshot
Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
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.1109/tsmc.1984.6313232openalex-snapshot
A graph distance measure for image analysis
inferredcites →https://doi.org/10.1142/5711openalex-snapshot
Handbook of Pattern Recognition and Computer Vision
inferredcites →https://doi.org/10.1142/9789812814913_0014openalex-snapshot
THREE-DIMENSIONAL OBJECT RECOGNITION BY ATTRIBUTED GRAPHS
inferredcites →https://doi.org/10.1142/9789814343138_0008openalex-snapshot
STRUCTURAL AND SYNTACTIC PATTERN RECOGNITION
inferredcites →https://doi.org/10.1142/s0218001497000081openalex-snapshot
Recent Advances in Graph Matching
inferredcites →https://doi.org/10.1142/s0218001498000415openalex-snapshot
Error-Correcting Graph Isomorphism Using Decision Trees
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11492542_17openalex-snapshot
Matching Attributed Graphs: 2nd-Order Probabilities for Pruning the Search Tree
inferred← citeshttps://doi.org/10.1007/3-540-44732-6_1openalex-snapshot
Towards Bridging the Gap between Statistical and Structural Pattern Recognition: Two New Concepts in Graph Matching
inferred← citeshttps://doi.org/10.1007/3-540-70659-3_26openalex-snapshot
Estimating the Joint Probability Distribution of Random Vertices and Arcs by Means of Second-Order Random Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-4401-2_10openalex-snapshot
Graph Matching and Similarity
inferred← citeshttps://doi.org/10.1007/978-3-031-13577-4_21openalex-snapshot
Pattern Recognition Using Graph Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-031-23028-8_24openalex-snapshot
Graph Similarity Using Tree Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-319-13560-1_38openalex-snapshot
Arduface: An Embedded System Analysis Tool
inferred← citeshttps://doi.org/10.1007/978-3-319-97785-0_32openalex-snapshot
Error-Tolerant Geometric Graph Similarity
inferred← citeshttps://doi.org/10.1007/978-3-540-31996-2_20openalex-snapshot
Ant Algorithm for the Graph Matching Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-12139-5_11openalex-snapshot
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures
inferred← citeshttps://doi.org/10.1007/978-3-662-44854-0_10openalex-snapshot
Detecting Recurring Deformable Objects: An Approximate Graph Matching Method for Detecting Characters in Comics Books
inferred← citeshttps://doi.org/10.1007/978-981-16-8546-0_34openalex-snapshot
Approximate Bipartite Graph Matching by Modifying Cost Matrix
inferred← citeshttps://doi.org/10.1007/s00138-014-0598-1openalex-snapshot
Attributed hypergraph matching on a Riemannian manifold
inferred← citeshttps://doi.org/10.1007/s10773-024-05576-0openalex-snapshot
Pregeometric Spaces from Wolfram Model Rewriting Systems as Homotopy Types
inferred← citeshttps://doi.org/10.1016/j.dam.2012.01.019openalex-snapshot
Using local similarity measures to efficiently address approximate graph matching
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.087openalex-snapshot
On the use of similarity metrics for approximate graph matching
inferred← citeshttps://doi.org/10.1016/j.jvcir.2015.05.001openalex-snapshot
A topology-based approach to computing neighborhood-of-interest points using the Morse complex
inferred← citeshttps://doi.org/10.1016/j.media.2011.05.015openalex-snapshot
Automatic segmentation of the wire frame of stent grafts from CT data
inferred← citeshttps://doi.org/10.1016/j.patrec.2018.09.014openalex-snapshot
Error-tolerant graph matching using node contraction
inferred← citeshttps://doi.org/10.1016/j.patrec.2019.06.025openalex-snapshot
Error-tolerant geometric graph similarity and matching
inferred← citeshttps://doi.org/10.1016/j.patrec.2020.03.019openalex-snapshot
Error-tolerant approximate graph matching utilizing node centrality information
inferred← citeshttps://doi.org/10.1016/s0167-8655(99)00094-xopenalex-snapshot
Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem
inferred← citeshttps://doi.org/10.1080/10447318.2011.555308openalex-snapshot
The Role of Structure and Content in Perception of Visual Similarity Between Web Pages
inferred← citeshttps://doi.org/10.1109/fskd.2011.6019722openalex-snapshot
Graph based pattern matching
inferred← citeshttps://doi.org/10.1109/icpr.2000.906030openalex-snapshot
Recent developments in graph matching
inferred← citeshttps://doi.org/10.1109/icpr.2002.1048257openalex-snapshot
Modelling and recognising 3D-objects described by multiple views using function-described graphs
inferred← citeshttps://doi.org/10.1109/tse.2013.9openalex-snapshot
MADMatch: Many-to-Many Approximate Diagram Matching for Design Comparison
inferred← citeshttps://doi.org/10.1145/1410358.1410359openalex-snapshot
Summarization system evaluation revisited
inferred← citeshttps://doi.org/10.1145/1869542.1869549openalex-snapshot
A recommender for conflict resolution support in optimistic model versioning
inferred← citeshttps://doi.org/10.1145/2523514.2523568openalex-snapshot
A clique-based method for mining fuzzy graph patterns in anti-money laundering systems
inferred← citeshttps://doi.org/10.1145/2911996.2912035openalex-snapshot
A Short Survey of Recent Advances in Graph Matching
inferred← citeshttps://doi.org/10.12681/eadd/18012openalex-snapshot
Automatic Summarization from Multiple Documents
inferred← citeshttps://doi.org/10.3990/1.9789036532662openalex-snapshot
Segmentation and motion estimation of stent grafts in abdominal aortic aneurysms
inferred← citeshttps://doi.org/10.48550/arxiv.1012.2042openalex-snapshot
MUDOS-NG: Multi-document Summaries Using N-gram Graphs (Tech Report)
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02929openalex-snapshot
Function-Described Graphs for Structural Pattern Recognition
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.5244/c.27.23openalex-snapshot
Modelling Visual Objects Invariant to Depictive Style
inferred← citeshttps://doi.org/10.57709/1223653openalex-snapshot
Metabolic Network Alignments and their Applications
inferred← citeshttps://doi.org/10.70675/3ae14a76zf809z454dz82a9z9414f1c69cf3openalex-snapshot
Appariement de graphes & [et] optimisation dynamique par colonies de fourmis
inferred← citeshttps://doi.org/10.70675/40712257z14d1z4fa2z83d1zb560d3ad0252openalex-snapshot
Recherche de motifs dans des images : apport des graphes plans
inferred← citeshttps://doi.org/10.70675/4c5b9ac8za52az4f9ez93d2zc0ae80dfd3e3openalex-snapshot
Graph Mining and Graph Classification : application to cadastral map analysis
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.