Preprint
Jul 2026
Average Distance Approximation for Static Large Graphs
The findings indicate that the Eppstein-Wang algorithm provides a practical and scalable solution for average distance estimation, with higher reliability on unipartite graphs compared to bipartite graphs.
Kartikey Ahlawat
· 0 citations