Erdos-Renyi random graphs
Emerging1papers using it
2025first seen
Erdos-Renyi random graphs are a type of random graph used to evaluate the performance of landmark-based algorithms in approximating pairwise distances through node embeddings.
Erdos-Renyi random graphs are a type of random graph used to evaluate the performance of landmark-based algorithms in approximating pairwise distances through node embeddings.