Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes
Matteo Stromieri, Emanuele Natale, Amos Korman
Efficiently locating rare targets requires balancing the exploration of novel space with the exploitation of local vicinities. While this tradeoff is well-documented in simplified…
cs.DS2025
Approximate -hop neighborhoods on incremental graphs: An efficient lazy approach
Luca Becchetti, Andrea Clementi, Luciano Gualà +3
In this work, we propose, analyze and empirically validate a lazy-update approach to maintain accurate approximations of the -hop neighborhoods of dynamic graphs resulting from…