On the public citation graph
A binary linear programming formulation of the graph edit distance
0 signed · 219 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/0471660264.ch1openalex-snapshot
Fundamentals of Pattern Recognition
inferredcites →https://doi.org/10.1002/9780470125847.ch1openalex-snapshot
Similarity Searching in Databases of Chemical Structures
inferredcites →https://doi.org/10.1002/qsar.19860050105openalex-snapshot
A Comparison of Some Measures for the Determination of Inter‐Molecular Structural Similarity Measures of Inter‐Molecular Structural Similarity
inferredcites →https://doi.org/10.1007/3-540-44522-6_26openalex-snapshot
Efficient Alignment and Correspondence Using Edit Distance
inferredcites →https://doi.org/10.1007/3-540-44683-4_60openalex-snapshot
Alignment between Two RNA Structures
inferredcites →https://doi.org/10.1007/978-1-4612-1480-9_3openalex-snapshot
Matching of Chemical and Biological Structures Using Subgraph and Maximal Common Subgraph Isomorphism Algorithms
inferredcites →https://doi.org/10.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/978-3-642-88304-0openalex-snapshot
Structural Pattern Recognition
inferredcites →https://doi.org/10.1007/bf01321861openalex-snapshot
Fundamentals of pattern recognition
inferredcites →https://doi.org/10.1007/bf01975866openalex-snapshot
A Constrained Edit Distance Between Unordered Labeled Trees
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.1016/s0166-218x(01)00290-6openalex-snapshot
A fast algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/s0167-8655(01)00017-4openalex-snapshot
A graph distance metric combining maximum common subgraph and minimum common supergraph
inferredcites →https://doi.org/10.1016/s0167-8655(01)00022-8openalex-snapshot
Graph distances using graph union
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.1021/ci00009a019openalex-snapshot
Molecular substructure similarity searching: efficient retrieval in two-dimensional structure databases
inferredcites →https://doi.org/10.1021/ci049860fopenalex-snapshot
The Reduced Graph Descriptor in Virtual Screening and Data-Driven Clustering of High-Throughput Screening Data
inferredcites →https://doi.org/10.1021/ja00465a041openalex-snapshot
Computer-aided interpretation of mass spectra. 20. Molecular structure comparison program for the identification of maximal common substructures
inferredcites →https://doi.org/10.1023/a:1016387816342openalex-snapshot
Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases
inferredcites →https://doi.org/10.1023/a:1021271615909openalex-snapshot
Maximum common subgraph isomorphism algorithms for the matching of chemical structures
inferredcites →https://doi.org/10.1038/sj.jors.2600826openalex-snapshot
Linear Programming: A Modern Integrated Analysis
inferredcites →https://doi.org/10.1049/sqj.1970.0088openalex-snapshot
Optimization by Vector Space Methods
inferredcites →https://doi.org/10.1093/comjnl/45.6.631openalex-snapshot
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
inferredcites →https://doi.org/10.1109/34.211474openalex-snapshot
A linear programming approach for the weighted graph matching problem
inferredcites →https://doi.org/10.1109/34.491619openalex-snapshot
A graduated assignment algorithm for graph matching
inferredcites →https://doi.org/10.1109/34.6778openalex-snapshot
An eigendecomposition approach to weighted graph matching problems
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.954601openalex-snapshot
Graph-based method for face identification from a single 2D line drawing
inferredcites →https://doi.org/10.1109/34.954603openalex-snapshot
Symbol recognition by error-tolerant subgraph matching between region adjacency graphs
inferredcites →https://doi.org/10.1109/icpr.2000.906030openalex-snapshot
Recent developments in graph matching
inferredcites →https://doi.org/10.1109/icpr.2002.1047427openalex-snapshot
A new algorithm for inexact graph matching
inferredcites →https://doi.org/10.1109/icpr.2004.1334548openalex-snapshot
A probabilistic approach to learning costs for graph edit distance
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tpami.2004.1273924openalex-snapshot
Recognition of shapes by editing their shock graphs
inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1109/tpami.2004.95openalex-snapshot
A POCS-based graph matching algorithm
inferredcites →https://doi.org/10.1109/tpami.2005.138openalex-snapshot
Exact and approximate graph matching using random walks
inferredcites →https://doi.org/10.1109/tpami.2005.146openalex-snapshot
Polynomial-time metrics for attributed trees
inferredcites →https://doi.org/10.1109/tpami.2005.56openalex-snapshot
Graph edit distance from spectral seriation
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.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/543613.543620openalex-snapshot
Algorithmics and applications of tree and graph searching
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
inferredcites →https://doi.org/10.5555/338219.338628openalex-snapshot
A tree-edit-distance algorithm for comparing simple, closed shapes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9783527627981.ch6openalex-snapshot
Graph Edit Distance – Optimal and Suboptimal Algorithms with Applications
inferred← citeshttps://doi.org/10.1002/widm.1099openalex-snapshot
Graph‐based methods for protein structure comparison
inferred← citeshttps://doi.org/10.1007/11585978_2openalex-snapshot
A Computational Approach to Fisher Information Geometry with Applications to Image 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-4614-4457-2_3openalex-snapshot
Median Graph Computation by Means of Graph Embedding into Vector Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-20081-7_2openalex-snapshot
GEDLIB: A C++ Library for Graph Edit Distance Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-20081-7_7openalex-snapshot
Solving the Graph Edit Distance Problem with Variable Partitioning Local Search
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_50openalex-snapshot
Verifying Equivalence Properties of Neural Networks with ReLU Activation Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-07998-1_36openalex-snapshot
Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy
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-11656-3_12openalex-snapshot
Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time
inferred← citeshttps://doi.org/10.1007/978-3-319-13410-9_3openalex-snapshot
Impact of Keypoint Detection on Graph-Based Characterization of Blood Vessels in Colonoscopy Videos
inferred← citeshttps://doi.org/10.1007/978-3-319-15895-2_50openalex-snapshot
Graph-Based Process Model Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-18224-7_1openalex-snapshot
Approximation of Graph Edit Distance in Quadratic Time
inferred← citeshttps://doi.org/10.1007/978-3-319-18224-7_14openalex-snapshot
A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-319-18224-7_8openalex-snapshot
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-20248-8_13openalex-snapshot
Suboptimal Graph Edit Distance Based on Sorted Local Assignments
inferred← citeshttps://doi.org/10.1007/978-3-319-21024-7_1openalex-snapshot
Greedy Graph Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-319-21024-7_2openalex-snapshot
Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation
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-27252-8_3openalex-snapshot
Bipartite Graph Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-319-40530-8_13openalex-snapshot
Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions
inferred← citeshttps://doi.org/10.1007/978-3-319-46759-7_1openalex-snapshot
BFST_ED: A Novel Upper Bound Computation Framework for the Graph Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-319-49055-7_43openalex-snapshot
Exact Graph Edit Distance Computation Using a Binary Linear Program
inferred← citeshttps://doi.org/10.1007/978-3-319-49055-7_44openalex-snapshot
Approximating Graph Edit Distance Using GNCCP
inferred← citeshttps://doi.org/10.1007/978-3-319-58961-9_19openalex-snapshot
Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs
inferred← citeshttps://doi.org/10.1007/978-3-319-75193-1_24openalex-snapshot
A Local Branching Heuristic for the Graph Edit Distance Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-97785-0_29openalex-snapshot
Graph Edit Distance in the Exact Context
inferred← citeshttps://doi.org/10.1007/978-3-319-98812-2_16openalex-snapshot
Edit Distance Based Similarity Search of Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72903-7_1openalex-snapshot
Bipartite Graph Matching for Computing the Edit Distance of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72903-7_9openalex-snapshot
A Quadratic Programming Approach to the Graph Edit Distance Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02011-7_11openalex-snapshot
Measuring the Similarity of Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-20844-7_11openalex-snapshot
Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching
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-662-44415-3_7openalex-snapshot
Improving Approximate Graph Edit Distance Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-46248-5_6openalex-snapshot
Graph Similarity Join with K-Hop Tree Indexing
inferred← citeshttps://doi.org/10.1007/s00542-019-04472-6openalex-snapshot
Efficient similarity join for certain graphs
inferred← citeshttps://doi.org/10.1007/s00778-013-0306-1openalex-snapshot
Efficient processing of graph similarity queries with edit distance constraints
inferred← citeshttps://doi.org/10.1007/s00778-019-00544-1openalex-snapshot
Comparing heuristics for graph edit distance computation
inferred← citeshttps://doi.org/10.1007/s10044-008-0141-yopenalex-snapshot
A survey of graph edit distance
inferred← citeshttps://doi.org/10.1007/s10107-020-01564-4openalex-snapshot
Convex graph invariant relaxations for graph edit distance
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/s10878-008-9184-7openalex-snapshot
Generalized median graphs and applications
inferred← citeshttps://doi.org/10.1007/s11063-017-9739-7openalex-snapshot
On the Impact of Using Utilities Rather than Costs for Graph Matching
inferred← citeshttps://doi.org/10.1007/s11280-014-0286-0openalex-snapshot
Efficient subgraph join based on connectivity similarity
inferred← citeshttps://doi.org/10.1007/s11416-011-0151-yopenalex-snapshot
Malware classification based on call graph clustering
inferred← citeshttps://doi.org/10.1007/s11704-015-4505-3openalex-snapshot
Efficient graph similarity join for information integration on graphs
inferred← citeshttps://doi.org/10.1007/s13042-013-0210-4openalex-snapshot
EM-type method for measuring graph dissimilarity
inferred← citeshttps://doi.org/10.1007/s42484-022-00077-xopenalex-snapshot
Computing graph edit distance on quantum devices
inferred← citeshttps://doi.org/10.1016/b978-012119792-6/50137-6openalex-snapshot
Statistical Models of Targets and Clutter for Use in Bayesian Object Recognition
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102056openalex-snapshot
Distance measures for geometric graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2018.02.002openalex-snapshot
A local branching heuristic for solving a Graph Edit Distance Problem
inferred← citeshttps://doi.org/10.1016/j.cviu.2010.12.010openalex-snapshot
A generic framework for median graph computation based on a recursive embedding approach
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.10.043openalex-snapshot
A parallel graph edit distance algorithm
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.04.008openalex-snapshot
Matching UML class models using graph edit distance
inferred← citeshttps://doi.org/10.1016/j.imavis.2008.04.004openalex-snapshot
Approximate graph edit distance computation by means of bipartite graph matching
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.is.2018.10.003openalex-snapshot
A novel edge-centric approach for graph edit similarity computation
inferred← citeshttps://doi.org/10.1016/j.is.2021.101766openalex-snapshot
Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing
inferred← citeshttps://doi.org/10.1016/j.jnca.2024.104043openalex-snapshot
Controller load optimization strategies in Software-Defined Networking: A survey
inferred← citeshttps://doi.org/10.1016/j.knosys.2013.10.015openalex-snapshot
Towards the estimation of feature-based semantic similarity using multiple ontologies
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.2008.10.021openalex-snapshot
Fuzzy lattice reasoning (FLR) type neural computation for weighted graph partitioning
inferred← citeshttps://doi.org/10.1016/j.patcog.2009.10.013openalex-snapshot
Generalized median graph computation by means of graph embedding in vector spaces
inferred← citeshttps://doi.org/10.1016/j.patcog.2012.05.022openalex-snapshot
An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings
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.patcog.2014.11.002openalex-snapshot
Improving bipartite graph edit distance approximation using various search strategies
inferred← citeshttps://doi.org/10.1016/j.patcog.2017.07.029openalex-snapshot
New binary linear programming formulation to compute the graph edit distance
inferred← citeshttps://doi.org/10.1016/j.patcog.2018.03.019openalex-snapshot
A novel hierarchical-based framework for upper bound computation of graph edit distance
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.01.043openalex-snapshot
Graph edit distance: Restrictions to be a metric
inferred← citeshttps://doi.org/10.1016/j.patcog.2021.108132openalex-snapshot
Learning graph edit distance by graph neural networks
inferred← citeshttps://doi.org/10.1016/j.patcog.2026.113764openalex-snapshot
Edges: An expressive and efficient model for learning Graph Edit Distance
inferred← citeshttps://doi.org/10.1016/j.patrec.2008.12.014openalex-snapshot
Median graph: A new exact algorithm using a distance based on the maximum common subgraph
inferred← citeshttps://doi.org/10.1016/j.patrec.2011.04.017openalex-snapshot
Towards the unification of structural and statistical pattern recognition
inferred← citeshttps://doi.org/10.1016/j.patrec.2014.04.015openalex-snapshot
Fast computation of Bipartite graph matching
inferred← citeshttps://doi.org/10.1016/j.patrec.2015.02.004openalex-snapshot
An improved global lower bound for graph edit similarity search
inferred← citeshttps://doi.org/10.1016/j.patrec.2015.08.003openalex-snapshot
Graph Edit Distance: Moving from global to local structure to solve the graph-matching problem
inferred← citeshttps://doi.org/10.1016/j.patrec.2015.10.007openalex-snapshot
Predicting the correctness of node assignments in bipartite graph matching
inferred← citeshttps://doi.org/10.1016/j.patrec.2015.11.026openalex-snapshot
Minimum cost subgraph matching using a binary linear program
inferred← citeshttps://doi.org/10.1016/j.patrec.2016.06.014openalex-snapshot
Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment
inferred← citeshttps://doi.org/10.1016/j.patrec.2016.10.001openalex-snapshot
Graph edit distance as a quadratic assignment problem
inferred← citeshttps://doi.org/10.1016/j.patrec.2017.10.007openalex-snapshot
Graph edit distance contest: Results and future challenges
inferred← citeshttps://doi.org/10.1016/j.patrec.2018.03.033openalex-snapshot
Graph edit distance: Accuracy of local branching from an application point of view
inferred← citeshttps://doi.org/10.1016/j.patrec.2018.05.002openalex-snapshot
On the exact computation of the graph edit distance
inferred← citeshttps://doi.org/10.1016/j.patrec.2018.08.026openalex-snapshot
Embedding the node-to-node mappings to learn the Graph edit distance parameters
inferred← citeshttps://doi.org/10.1016/j.patrec.2019.06.024openalex-snapshot
Combining graph edit distance and triplet networks for offline signature verification
inferred← citeshttps://doi.org/10.1016/j.patrec.2021.02.014openalex-snapshot
On the unification of the graph edit distance and graph matching problems
inferred← citeshttps://doi.org/10.1016/j.patrec.2021.02.019openalex-snapshot
On-line learning the graph edit distance costs
inferred← citeshttps://doi.org/10.1101/2021.06.03.446936openalex-snapshot
Sea Turtle Facial Recognition Using Map Graphs of Scales
inferred← citeshttps://doi.org/10.1109/access.2025.3561083openalex-snapshot
SDN-Based Edge Computing in Vehicular Communication Networks: A Survey of Existing Approaches
inferred← citeshttps://doi.org/10.1109/bigdata.2013.6691785openalex-snapshot
Provenance comparison for large-scale knowledge discovery
inferred← citeshttps://doi.org/10.1109/cvpr.2013.171openalex-snapshot
Gauging Association Patterns of Chromosome Territories via Chromatic Median
inferred← citeshttps://doi.org/10.1109/das.2014.16openalex-snapshot
Iterative Bipartite Graph Edit Distance Approximation
inferred← citeshttps://doi.org/10.1109/icassp.2012.6288059openalex-snapshot
Generic object recognition by graph structural expression
inferred← citeshttps://doi.org/10.1109/iccv.2007.4408966openalex-snapshot
Generalized Median Graphs: Theory and Applications
inferred← citeshttps://doi.org/10.1109/icde.2012.28openalex-snapshot
An Efficient Graph Indexing Method
inferred← citeshttps://doi.org/10.1109/icde.2012.91openalex-snapshot
Efficient Graph Similarity Joins with Edit Distance Constraints
inferred← citeshttps://doi.org/10.1109/icde.2017.57openalex-snapshot
Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance
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/icee50131.2020.9261075openalex-snapshot
A Weighted Distance Learning Method for Graph Classification
inferred← citeshttps://doi.org/10.1109/icpr.2014.670openalex-snapshot
Improving Graph Edit Distance Approximation by Centrality Measures
inferred← citeshttps://doi.org/10.1109/icpr.2016.7899881openalex-snapshot
Graph edit distance as a quadratic program
inferred← citeshttps://doi.org/10.1109/icpr.2018.8546055openalex-snapshot
Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1109/itsc57777.2023.10422489openalex-snapshot
Travel-Activity Patterns Identification Using Graph Edit Distance
inferred← citeshttps://doi.org/10.1109/jlt.2013.2293193openalex-snapshot
Survivable Virtual Network Design and Embedding to Survive a Facility Node Failure
inferred← citeshttps://doi.org/10.1109/jsyst.2022.3222357openalex-snapshot
Path Planning for Multiple Unmanned Surface Vehicles Using Glasius Bio-Inspired Neural Network With Hungarian Algorithm
inferred← citeshttps://doi.org/10.1109/sai.2017.8252129openalex-snapshot
Tolerant similarity search in graph database
inferred← citeshttps://doi.org/10.1109/tcbb.2015.2478463openalex-snapshot
Approximate Graph Edit Distance in Quadratic Time
inferred← citeshttps://doi.org/10.1109/tccn.2022.3147196openalex-snapshot
Applications of Auction and Mechanism Design in Edge Computing: A Survey
inferred← citeshttps://doi.org/10.1109/tkde.2010.28openalex-snapshot
Efficiently Indexing Large Sparse Graphs for Similarity Search
inferred← citeshttps://doi.org/10.1109/tkde.2017.2772243openalex-snapshot
Improved Lower Bounds for Graph Edit Distance
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/tpami.2017.2767591openalex-snapshot
Graph Matching with Adaptive and Branching Path Following
inferred← citeshttps://doi.org/10.1109/tsc.2021.3054036openalex-snapshot
Identifying a Minimum Sequence of High-Level Changes Between Workflows
inferred← citeshttps://doi.org/10.1109/tsmcb.2009.2019264openalex-snapshot
Graph Classification by Means of Lipschitz Embedding
inferred← citeshttps://doi.org/10.1109/tsp.2024.3449091openalex-snapshot
Graph GOSPA Metric: A Metric to Measure the Discrepancy Between Graphs of Different Sizes
inferred← citeshttps://doi.org/10.1115/detc2006-99066openalex-snapshot
Free-Form Feature Representation and Comparison
inferred← citeshttps://doi.org/10.1137/1.9781611974010.85openalex-snapshot
REAFUM: Representative Approximate Frequent Subgraph Mining
inferred← citeshttps://doi.org/10.1142/9789814273398_0003openalex-snapshot
ON DISSIMILARITY EMBEDDING OF GRAPHS IN VECTOR SPACES
inferred← citeshttps://doi.org/10.1142/9789814656535_0015openalex-snapshot
GRAPH EDIT DISTANCE — NOVEL APPROXIMATION ALGORITHMS
inferred← citeshttps://doi.org/10.1142/s021800140900748xopenalex-snapshot
GRAPH CLASSIFICATION BASED ON VECTOR SPACE EMBEDDING
inferred← citeshttps://doi.org/10.1142/s021800141260004xopenalex-snapshot
ON THE GRAPH EDIT DISTANCE COST: PROPERTIES AND APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0218001413600021openalex-snapshot
EMBEDDING OF GRAPHS WITH DISCRETE ATTRIBUTES VIA LABEL FREQUENCIES
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.1142/s0218001418500386openalex-snapshot
A Methodology to Generate Attributed Graphs with a Bounded Graph Edit Distance for Graph-Matching Testing
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/1653662.1653736openalex-snapshot
Large-scale malware indexing using function-call graphs
inferred← citeshttps://doi.org/10.1145/1963192.1963299openalex-snapshot
A tool for fast indexing and querying of graphs
inferred← citeshttps://doi.org/10.1145/1982185.1982509openalex-snapshot
Improved call graph comparison using simulated annealing
inferred← citeshttps://doi.org/10.1145/2457317.2457352openalex-snapshot
A similarity measure for approximate querying over RDF data
inferred← citeshttps://doi.org/10.1145/2505515.2505723openalex-snapshot
Graph similarity search with edit distance constraint in large graph databases
inferred← citeshttps://doi.org/10.1145/2699878openalex-snapshot
Degree Reduction in Labeled Graph Retrieval
inferred← citeshttps://doi.org/10.1145/2808719.2808724openalex-snapshot
Mining k-median chromosome association graphs from a population of heterogeneous cells
inferred← citeshttps://doi.org/10.1145/3709673openalex-snapshot
Computing Approximate Graph Edit Distance via Optimal Transport
inferred← citeshttps://doi.org/10.1145/3725304openalex-snapshot
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods
inferred← citeshttps://doi.org/10.1145/3746252.3761209openalex-snapshot
Masked Graph Distance Network for Accurate Subgraph Similarity Computation
inferred← citeshttps://doi.org/10.11575/prism/27675openalex-snapshot
Robust Temperature-Based Optimization for Global Routing
inferred← citeshttps://doi.org/10.11648/j.ajsea.20130201.13openalex-snapshot
Generic Object Recognition Using Graph Embedding into A Vector Space
inferred← citeshttps://doi.org/10.1186/s13321-025-00958-wopenalex-snapshot
Crossover operators for molecular graphs with an application to virtual drug screening
inferred← citeshttps://doi.org/10.1364/ofc.2011.owaa3openalex-snapshot
A Novel Two-Step Approach to Surviving Facility Failures
inferred← citeshttps://doi.org/10.14778/2994509.2994531openalex-snapshot
RDF graph alignment with bisimulation
inferred← citeshttps://doi.org/10.14778/3748191.3748221openalex-snapshot
Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond
inferred← citeshttps://doi.org/10.14778/3749646.3749726openalex-snapshot
Enhancing Graph Edit Distance Computation: Stronger and Orientation-Based ILP Formulations
inferred← citeshttps://doi.org/10.21437/interspeech.2011-439openalex-snapshot
Semantic graph clustering for POMDP-based spoken dialog systems
inferred← citeshttps://doi.org/10.21437/interspeech.2013-610openalex-snapshot
Automatic human utility evaluation of ASR systems: does WER really predict performance?
inferred← citeshttps://doi.org/10.31274/etd-180810-635openalex-snapshot
Computation of evolutionary change
inferred← citeshttps://doi.org/10.4018/978-1-4666-1891-6.ch008openalex-snapshot
Graph Embedding Using Dissimilarities with Applications in Classification
inferred← citeshttps://doi.org/10.4018/978-1-4666-3994-2.ch020openalex-snapshot
Graph Embedding Using Dissimilarities with Applications in Classification
inferred← citeshttps://doi.org/10.4467/20838476si.23.001.19323openalex-snapshot
Measuring Similarity Between ETL Processes Using Graph Edit Distance
inferred← citeshttps://doi.org/10.48550/arxiv.1008.4365openalex-snapshot
Malware Classification based on Call Graph Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05740openalex-snapshot
Graph edit distance : a new binary linear programming formulation
inferred← citeshttps://doi.org/10.48550/arxiv.1512.07494openalex-snapshot
A Quadratic Assignment Formulation of the Graph Edit Distance
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04380openalex-snapshot
Linear Sum Assignment with Edition
inferred← citeshttps://doi.org/10.48550/arxiv.1606.08657openalex-snapshot
RDF Graph Alignment with Bisimulation
inferred← citeshttps://doi.org/10.48550/arxiv.1908.00265openalex-snapshot
New Techniques for Graph Edit Distance Computation
inferred← citeshttps://doi.org/10.48550/arxiv.2111.02591openalex-snapshot
Minimum-Complexity Graph Simplification under Fréchet-Like Distances
inferred← citeshttps://doi.org/10.5220/0005209202710278openalex-snapshot
An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems
inferred← citeshttps://doi.org/10.54254/2755-2721/6/20230653openalex-snapshot
Research advanced in offline handwritten signature verification
inferred← citeshttps://doi.org/10.5821/dissertation-2117-96160openalex-snapshot
El modelo eléctrico de conductancias aplicado al isomorfismo de grafos : el método de la estrella
inferred← citeshttps://doi.org/10.63876/ijtm.v2i2.124openalex-snapshot
Efficient Resource Allocation in Cloud Computing Environments: A Modelling Perspective
inferred← citeshttps://doi.org/10.70675/25248cddz689az4f98z8bd2z381c02a454c3openalex-snapshot
When operations research meets structural pattern recognition : on the solution of error-tolerant graph matching problems
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/dc93c1caz03e1z43aaz85e0z6726c8e850ceopenalex-snapshot
Anytime and distributed approaches for graph matching
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.