Pages that link to "Item:Q6041769"
From MaRDI portal
The following pages link to Exact matching of random graphs with constant correlation (Q6041769):
Displaying 7 items.
- Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs (Q136800) (← links)
- Efficient random graph matching via degree profiles (Q2660385) (← links)
- Correlation of Paths Between Distinct Vertices in a Randomly Oriented Graph (Q5261721) (← links)
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
- Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality (Q6072327) (← links)
- Matching recovery threshold for correlated random graphs (Q6183756) (← links)
- A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs (Q6641062) (← links)