A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Shortest-path computation is central to many graph queries. However, current graph-processing platforms tend to offer limited solutions, typically supporting only single-source and all-pairs shortest path algorithms, with poor filtering options. In this paper we address the shortest-path computation problem in two complementary directions. First, we introduce a restrictable, top-N "bulk" shortest-weighted-paths operator in the Cypher graph query language, that subsumes all previously knowndoi:10.1145/2960414.2960420 dblp:conf/grades/RutgersMVB16 fatcat:3la56oprzfeltl3r7yn4nwl4eu