8 citations · 11 across the 3 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2020
Sequential Algorithms and Independent Sets Discovering on Large Sparse Random Graphs
Paola Bermolen, Matthieu Jonckheere, Federico Larroca +1
Computing the size of maximum independent sets is a NP-hard problem for fixed graphs. Characterizing and designing efficient algorithms to estimate this independence number for ran…
math.PR2015★ 3 cited
Scaling limits for exploration algorithms
Paola Bermolen, Matthieu Jonckheere, Jaron Sanders
We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items growing to in…