Pages that link to "Item:Q2962278"
From MaRDI portal
The following pages link to On convex relaxation of graph isomorphism (Q2962278):
Displaying 13 items.
- An algorithm for weighted sub-graph matching based on gradient flows (Q1671710) (← links)
- Network alignment by discrete Ollivier-Ricci flow (Q1725779) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- Efficient random graph matching via degree profiles (Q2660385) (← links)
- Exact Recovery with Symmetries for the Doubly Stochastic Relaxation (Q4554591) (← links)
- Sparse Models for Intrinsic Shape Correspondence (Q4603064) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- (Q5053318) (← links)
- Exact Recovery with Symmetries for Procrustes Matching (Q5348459) (← links)
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
- Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality (Q6072327) (← links)
- Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs (Q6621859) (← links)
- Linearly scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction (Q6644161) (← links)
