How to sample maximal shortest paths in a graph?

Let S be the set of all possible s-t shortest paths in a directed graph. A path s in S is said to be maximal if it is not a subpath of another path in S. Let M be the set of all maximal paths in...

11 November 2016 9,440 5 View