Finding shortest distances in a graph is one the fundamental problems in computer science with numerous applications (route planning by CityMapper and Google/Yandex-maps, for example). You have ...

Abstract: Counting the number of shortest paths between two query vertices on road networks has a wide range of applications and has recently drawn significant research attention. The state-of-the-art ...

Abstract: In this research, we propose a novel denoising diffusion model based on shortest-path modeling that optimizes residual propagation to enhance both denoising efficiency and quality. Drawing ...

This algorithm is used to solve what is known as the generalized birthday problem. Given a modulus $n$, and $k$ lists of random numbers $\{L_1, L_2, ..., L_k\}$, how ...