On the public citation graph
Graph Matching using Spectral Embedding and Semidefinite Programming
0 signed · 33 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.1007/3-540-70659-3_13openalex-snapshot
Inexact Multisubgraph Matching Using Graph Eigenspace and Clustering Models
inferredcites →https://doi.org/10.1007/978-1-4615-4381-7openalex-snapshot
Handbook of Semidefinite Programming
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1016/0262-8856(92)90043-3openalex-snapshot
Feature-based correspondence: an eigenvector approach
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.1098/rspb.1991.0045openalex-snapshot
An algorithm for associating the features of two images
inferredcites →https://doi.org/10.1109/34.400565openalex-snapshot
Structural matching in computer vision using probabilistic relaxation
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.954602openalex-snapshot
Structural graph matching using the EM algorithm and singular value decomposition
inferredcites →https://doi.org/10.1109/cvpr.1999.784726openalex-snapshot
Indexing using a spectral encoding of topological structure
inferredcites →https://doi.org/10.1109/tpami.1985.4767621openalex-snapshot
A Metric for Comparing Relational Descriptions
inferredcites →https://doi.org/10.1109/tpami.2003.1195989openalex-snapshot
Properties of embedding methods for similarity searching in metric spaces
inferredcites →https://doi.org/10.1126/science.290.5500.2319openalex-snapshot
A Global Geometric Framework for Nonlinear Dimensionality Reduction
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.7551/mitpress/1120.003.0080openalex-snapshot
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11585978_14openalex-snapshot
Linear Programming Matching and Appearance-Adaptive Object Tracking
inferred← citeshttps://doi.org/10.1007/11815921_48openalex-snapshot
Graph Embedding Using Commute Time
inferred← citeshttps://doi.org/10.1007/978-3-319-23192-1_39openalex-snapshot
A High-Order Depth-Based Graph Matching Method
inferred← citeshttps://doi.org/10.1007/978-3-540-31988-7_36openalex-snapshot
Recent Results on Heat Kernel Embedding of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-88682-2_11openalex-snapshot
Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities
inferred← citeshttps://doi.org/10.1007/978-3-642-17711-8_8openalex-snapshot
Graph Embedding for Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-20844-7_18openalex-snapshot
Graph Matching Based on Dot Product Representation of Graphs
inferred← citeshttps://doi.org/10.1007/s00778-012-0292-8openalex-snapshot
High efficiency and quality: large graphs matching
inferred← citeshttps://doi.org/10.1016/j.cviu.2008.06.002openalex-snapshot
Canonical subsets of image features
inferred← citeshttps://doi.org/10.1016/j.patcog.2014.01.002openalex-snapshot
A long trip in the charming world of graphs for Pattern Recognition
inferred← citeshttps://doi.org/10.1109/3dv53792.2021.00129openalex-snapshot
Convex Joint Graph Matching and Clustering via Semidefinite Relaxations
inferred← citeshttps://doi.org/10.1109/access.2019.2904541openalex-snapshot
Left Ventricle Motion Estimation in Cine MRI With Multilayer Iterative Deformable Graph Matching
inferred← citeshttps://doi.org/10.1109/tip.2008.2006602openalex-snapshot
Correspondence Propagation with Weak Priors
inferred← citeshttps://doi.org/10.1109/tpami.2007.1048openalex-snapshot
Matching by Linear Programming and Successive Convexification
inferred← citeshttps://doi.org/10.14864/softscis.2006.0.1008.0openalex-snapshot
Coincidence-Based Refinement of Ontology Matching
inferred← citeshttps://doi.org/10.20965/jaciii.2007.p0803openalex-snapshot
Coincidence-Based Scoring of Mappings in Ontology Alignment
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.