Abstract: Graph searchable encryption (GSE) for shortest path queries allows users to discover the closest connection between two individuals in encrypted social network graphs, while safeguarding ...

Abstract: In this paper, we consider the problem of finding the shortest path in a graph when there is aleatoric uncertainty about the presence and/or cost of certain edges. We investigate hybrid path ...

Those that solve artificially simplified problems where quantum advantage is meaningless. Those that provide no genuine quantum advantage when all costs are properly accounted for. This critique is ...

A header-only C++ implementation of the single-source shortest path (SSSP) algorithm for sparse directed graphs with non-negative weights, based on the 2025 paper by Duan et al. This algorithm is ...