On the public citation graph

Stable and Informative Spectral Signatures for Graph Matching

0 signed · 59 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/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1007/11585978_12openalex-snapshot
Probabilistic Subgraph Matching Based on Convex Relaxation
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-70659-3_10openalex-snapshot
String Edit Distance, Random Walks and Graph Matching
inferredcites →https://doi.org/10.1007/978-3-540-73510-6openalex-snapshot
Laplacian Eigenvectors of Graphs: Perron-Frobenius and Faber-Krahn Type Theorems
inferredcites →https://doi.org/10.1007/978-3-540-74171-8_131openalex-snapshot
Using Eigen-Decomposition Method for Weighted Graph Matching
inferredcites →https://doi.org/10.1007/978-3-642-02124-4_16openalex-snapshot
Graph Matching Based on Node Signatures
inferredcites →https://doi.org/10.1007/978-3-642-15555-0_36openalex-snapshot
Reweighted Random Walks for Graph Matching
inferredcites →https://doi.org/10.1007/978-3-642-24785-9_58openalex-snapshot
Deformable Shape Retrieval by Learning Diffusion Kernels
inferredcites →https://doi.org/10.1016/j.acha.2010.04.005openalex-snapshot
Wavelets on graphs via spectral graph theory
inferredcites →https://doi.org/10.1016/j.patcog.2005.06.014openalex-snapshot
Graph matching and clustering using spectral partitions
inferredcites →https://doi.org/10.1016/j.patcog.2008.03.011openalex-snapshot
A study of graph spectra for comparing graphs and trees
inferredcites →https://doi.org/10.1016/j.patcog.2008.09.001openalex-snapshot
Graph matching using the interference of continuous-time quantum walks
inferredcites →https://doi.org/10.1093/acprof:oso/9780199206650.001.0001openalex-snapshot
Networks: An Introduction
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.2008.4587500openalex-snapshot
Probabilistic graph and hypergraph matching
inferredcites →https://doi.org/10.1109/cvpr.2009.5206619openalex-snapshot
A tensor-based algorithm for high-order graph matching
inferredcites →https://doi.org/10.1109/cvpr.2011.5995387openalex-snapshot
Hyper-graph matching via reweighted random walks
inferredcites →https://doi.org/10.1109/cvpr.2012.6247667openalex-snapshot
Factorized graph matching
inferredcites →https://doi.org/10.1109/cvpr.2013.374openalex-snapshot
Graph Matching with Anchor Nodes: A Learning Approach
inferredcites →https://doi.org/10.1109/iccv.2005.20openalex-snapshot
A spectral technique for correspondence problems using pairwise constraints
inferredcites →https://doi.org/10.1109/iccvw.2011.6130444openalex-snapshot
The wave kernel signature: A quantum mechanical approach to shape analysis
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.56openalex-snapshot
Graph edit distance from spectral seriation
inferredcites →https://doi.org/10.1109/tpami.2008.245openalex-snapshot
A Path Following Algorithm for the Graph Matching Problem
inferredcites →https://doi.org/10.1109/tpami.2010.51openalex-snapshot
Efficient High Order Matching
inferredcites →https://doi.org/10.1109/tpami.2012.51openalex-snapshot
A Probabilistic Approach to Spectral Graph Matching
inferredcites →https://doi.org/10.1109/tpami.2013.148openalex-snapshot
Learning Spectral Descriptors for Deformable Shape Correspondence
inferredcites →https://doi.org/10.1109/tsmc.1984.6313232openalex-snapshot
A graph distance measure for image analysis
inferredcites →https://doi.org/10.1109/tvcg.2006.92openalex-snapshot
Graph Signatures for Visual Analytics
inferredcites →https://doi.org/10.1111/j.1467-8659.2009.01515.xopenalex-snapshot
A Concise and Provably Informative Multi‐Scale Signature Based on Heat Diffusion
inferredcites →https://doi.org/10.1142/s0218001404003277openalex-snapshot
STRING EDIT DISTANCE, RANDOM WALKS AND GRAPH MATCHING
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0044openalex-snapshot
Balanced Graph Matching

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-58607-2_15openalex-snapshot
Layered Neighborhood Expansion for Incremental Multiple Graph Matching
inferred← citeshttps://doi.org/10.1007/s11042-017-5226-4openalex-snapshot
RETRACTED ARTICLE: Fast quadratic-programming-based graph matching algorithm with image applications
inferred← citeshttps://doi.org/10.1007/s11042-019-08516-xopenalex-snapshot
Graph matching based on local and global information of the graph nodes
inferred← citeshttps://doi.org/10.1007/s11042-022-14071-9openalex-snapshot
A novel graph matching method based on multiple information of the graph nodes
inferred← citeshttps://doi.org/10.1007/s41109-019-0179-3openalex-snapshot
Persistence homology of networks: methods and applications
inferred← citeshttps://doi.org/10.1007/s41468-023-00125-wopenalex-snapshot
Heat diffusion distance processes: a statistically founded method to analyze graph data sets
inferred← citeshttps://doi.org/10.1109/3dv50981.2020.00067openalex-snapshot
Unsupervised Dense Shape Correspondence using Heat Kernels
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00261openalex-snapshot
Distributable Consistent Multi-object Matching
inferred← citeshttps://doi.org/10.1109/icassp.2015.7178601openalex-snapshot
Multi-graph learning of spectral graph dictionaries
inferred← citeshttps://doi.org/10.1109/iccv.2015.15openalex-snapshot
Mining And-Or Graphs for Graph Matching and Object Discovery
inferred← citeshttps://doi.org/10.1109/icip.2015.7351401openalex-snapshot
Graph-based motion estimation and compensation for dynamic 3D point cloud compression
inferred← citeshttps://doi.org/10.1109/isbi.2018.8363583openalex-snapshot
MRI slice stacking using manifold alignment and wave kernel signatures
inferred← citeshttps://doi.org/10.1109/tip.2016.2529506openalex-snapshot
Graph-Based Compression of Dynamic 3D Point Cloud Sequences
inferred← citeshttps://doi.org/10.1109/tpami.2019.2891600openalex-snapshot
Weighted Manifold Alignment using Wave Kernel Signatures for Aligning Medical Image Datasets
inferred← citeshttps://doi.org/10.1109/wispnet.2018.8538596openalex-snapshot
An Improved Compatibility Based on Weighted Local and Global Information for Graph Matching
inferred← citeshttps://doi.org/10.1371/journal.pone.0284820openalex-snapshot
Genomics data analysis via spectral shape and topology
inferred← citeshttps://doi.org/10.48550/arxiv.1707.08991openalex-snapshot
Efficient Deformable Shape Correspondence via Kernel Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1904.09378openalex-snapshot
PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signatures
inferred← citeshttps://doi.org/10.48550/arxiv.1909.13472openalex-snapshot
ATOL: Measure Vectorization for Automatic Topologically-Oriented Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1912.10314openalex-snapshot
Multimodal Prediction based on Graph Representations
inferred← citeshttps://doi.org/10.48550/arxiv.2006.04163openalex-snapshot
Generalized Spectral Clustering via Gromov-Wasserstein Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2106.01098openalex-snapshot
Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions
inferred← citeshttps://doi.org/10.70675/4f9e6845zf144z4819z95b6z929d773bf9f3openalex-snapshot
Contributions to statistical analysis of graph-structured data
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.