1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.SI2024★ 1 cited
Balanced Bidirectional Breadth-First Search on Scale-Free Networks
Sacha Cerf, Benjamin Dayan, Umberto De Ambroggio +3
To find a shortest path between two nodes and in a given graph, a classical approach is to start a Breadth-First Search (BFS) from and run it until the search dis…
cs.SI2024
Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric
Benjamin Dayan, Marc Kaufmann, Ulysse Schaller
Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bläsius et al. have proposed a framework for systematic evaluat…