Pages that link to "Item:Q903552"
From MaRDI portal
The following pages link to Graph matching by simplified convex-concave relaxation procedure (Q903552):
Displaying 10 items.
- A quadratic penalty method for hypergraph matching (Q683734) (← links)
- An algorithm for weighted sub-graph matching based on gradient flows (Q1671710) (← links)
- Efficient feature matching via nonnegative orthogonal relaxation (Q2193822) (← links)
- Dual \(L_1\)-normalized context aware tensor power iteration and its applications to multi-object tracking and multi-graph matching (Q2193853) (← links)
- Lagrangian relaxation graph matching (Q2289603) (← links)
- On convex relaxation of graph isomorphism (Q2962278) (← links)
- Exact Recovery with Symmetries for the Doubly Stochastic Relaxation (Q4554591) (← links)
- (Q4786059) (← links)
- Graph matching with hierarchical discrete relaxation (Q4934137) (← links)
- Efficient joint object matching via linear programming (Q6052052) (← links)