Pages that link to "Item:Q2289603"
From MaRDI portal
The following pages link to Lagrangian relaxation graph matching (Q2289603):
Displaying 9 items.
- A quadratic penalty method for hypergraph matching (Q683734) (← links)
- A sparse nonnegative matrix factorization technique for graph matching problems (Q898325) (← links)
- Graph matching by simplified convex-concave relaxation procedure (Q903552) (← links)
- Lagrangian relaxations for multiple network alignment (Q1741341) (← links)
- Efficient feature matching via nonnegative orthogonal relaxation (Q2193822) (← links)
- The graph association problem: Mathematical models and a lagrangian heuristic (Q3120602) (← links)
- Graph matching with hierarchical discrete relaxation (Q4934137) (← links)
- An efficient algorithm for bounded spectral matching with affine constraint (Q5206499) (← links)
- Efficient joint object matching via linear programming (Q6052052) (← links)