Pages that link to "Item:Q5093855"
From MaRDI portal
The following pages link to Aligning random graphs with a sub-tree similarity message-passing algorithm (Q5093855):
Displaying 4 items.
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
- Correlation detection in trees for planted graph alignment (Q6591586) (← links)
- Statistical limits of correlation detection in trees (Q6616873) (← links)
- A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs (Q6641062) (← links)
