Pages that link to "Item:Q6072326"
From MaRDI portal
The following pages link to Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326):
Displaying 10 items.
- A spectral-multiplicity-tolerant approach to robust graph matching (Q888578) (← links)
- A fast projected fixed-point algorithm for large graph matching (Q2417841) (← links)
- Efficient random graph matching via degree profiles (Q2660385) (← links)
- On spectral properties for graph matching and graph isomorphism problems (Q4603695) (← links)
- An efficient algorithm for bounded spectral matching with affine constraint (Q5206499) (← links)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466333) (← links)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466390) (← links)
- Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality (Q6072327) (← links)
- Statistical limits for testing correlation of random hypergraphs (Q6564542) (← links)
- A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs (Q6641062) (← links)