409 citations · 1.1k across the 33 of their papers we have counts for
1 paper · 1 filter
Gianlorenzo D'Angelo, Andrea D'Ascenzo, Mattia D'Emidio +2
Computing the top-k \textit{simple} shortest paths between two vertices of a graph, i.e., solving the P-KSSP problem, is a fundamental primitive in graph analytics. In modern sce…