An eigendecomposition approach to weighted graph matching problems

Cited in

(71)

Graph matching using the interference of continuous-time quantum walks
Kronecker product graph matching.
An algorithm for weighted sub-graph matching based on gradient flows
A long trip in the charming world of graphs for pattern recognition
Approximation of graph edit distance based on Hausdorff matching
A quantum Jensen-Shannon graph kernel for unattributed graphs
Graph-based point drift: graph centrality on the registration of point-sets
On searching and indexing sequences of temporal intervals
Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs
Spectral correspondence for point pattern matching
A polynomial transform for matching pairs of weighted graphs
Shape-based object detection via boundary structure segmentation
A quotient space formulation for generative statistical analysis of graphical data
Image matching from handcrafted to deep features: a survey
A new matching algorithm between trees of shapes and its application to brain tumor segmentation
Tail bounds for gaps between eigenvalues of sparse random matrices
Graph comparison via nonlinear quantum search
Statistical shape analysis of brain arterial networks (BAN)
Efficient feature matching via nonnegative orthogonal relaxation
Spectral graph features for the classification of graphs and graph sequences
Generalized median graphs and applications
Matching the LBO eigenspace of non-rigid shapes via high order statistics
Graph simplification and matching using commute times
A dynamical systems approach to weighted graph matching
Statistical graph space analysis
A fast projected fixed-point algorithm for large graph matching
Heat kernel embeddings, differential geometry and graph structure
Graph similarity scoring and matching
Correspondence matching using kernel principal components analysis and label consistency constraints
A spectral approach to learning structural variations in graphs
Attributed relational graph matching based on the nested assignment structure
Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues
Quantum walk inspired algorithm for graph similarity and isomorphism
\texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices
sGDML: constructing accurate and data efficient molecular force fields using machine learning
APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES
NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES
Efficient Suboptimal Graph Isomorphism
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
Unsupervised learning for graph matching
On spectral properties for graph matching and graph isomorphism problems
A general system for heuristic minimization of convex functions over non-convex sets
Graph similarity through entropic manifold alignment
scientific article; zbMATH DE number 1833438 (Why is no real title available?)
Spatial Pattern Discovering by Learning the Isomorphic Subgraph from Multiple Attributed Relational Graphs
Using local similarity measures to efficiently address approximate graph matching
Toward quantifying vertex similarity in networks
Graph similarity and approximate isomorphism
scientific article; zbMATH DE number 7626795 (Why is no real title available?)
A distance measure for large graphs based on prime graphs
Algorithm for cataloging topologies in the common information model (CIM)
Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis
Lightning graph matching
Quadratic nonnegative matrix factorization
Hypergraph co-optimal transport: metric and categorical properties
Continuous optimization methods for the graph isomorphism problem
Fuzzy morphisms between graphs
On the existence of Monge maps for the Gromov-Wasserstein problem
Graph matching via convex relaxation to the simplex
A survey of graph edit distance
Graph matching based on similarities in structure and attributes
Recognition of structure similarities in proteins
LieDetect: detection of representation orbits of compact Lie groups from point clouds
A Riemannian approach to graph embedding
A spectral-multiplicity-tolerant approach to robust graph matching
Graph matching by simplified convex-concave relaxation procedure
A gradient-type algorithm optimizing the coupling between matrices
Image categorization: Graph edit distance \(+\) edge direction histogram
A study of graph spectra for comparing graphs and trees
Machine learning problems from optimization perspective

This page was built for publication: An eigendecomposition approach to weighted graph matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834090)