Pages that link to "Item:Q3834090"
From MaRDI portal
The following pages link to An eigendecomposition approach to weighted graph matching problems (Q3834090):
Displaying 16 items.
- sGDML: constructing accurate and data efficient molecular force fields using machine learning (Q2696420) (← links)
- APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES (Q3101554) (← links)
- NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES (Q3503029) (← links)
- Efficient Suboptimal Graph Isomorphism (Q3637695) (← links)
- Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors (Q3637698) (← links)
- On spectral properties for graph matching and graph isomorphism problems (Q4603695) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- Graph Similarity through Entropic Manifold Alignment (Q4689636) (← links)
- (Q4780826) (← links)
- Spatial Pattern Discovering by Learning the Isomorphic Subgraph from Multiple Attributed Relational Graphs (Q4917093) (← links)
- Toward Quantifying Vertex Similarity in Networks (Q4985357) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- (Q5053318) (← links)
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
- Lightning graph matching (Q6593342) (← links)
- Hypergraph co-optimal transport: metric and categorical properties (Q6650214) (← links)
