3 citations · 3 across the 1 of their papers we have counts for
1 paper
Zeyu Jing, Markus Meister
Given a directed graph of nodes and edges connecting them, a common problem is to find the shortest path between any two nodes. Here we show that the shortest path distances can be…