Abstract: The shortest path problem is to find a path between two vertices (nodes) on a given graph, such that the sum of the weights on its constituent edges is minimized. This problem has been ...

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 ...