1 citations · 1 across the 2 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.NE2024
How Population Diversity Influences the Efficiency of Crossover
Sacha Cerf, Johannes Lengler
Our theoretical understanding of crossover is limited by our ability to analyze how population diversity evolves. In this study, we provide one of the first rigorous analyses of po…