Graph Matching via convex relaxation to the simplex (Q6457492)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph Matching via convex relaxation to the simplex |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph Matching via convex relaxation to the simplex |
preprint article from arXiv |
Statements
31 October 2023
0 references
stat.ML
0 references
cs.LG
0 references
math.ST
0 references
stat.TH
0 references
Ernesto Araya Valdivia
0 references
Hemant Tyagi
0 references
