How to Compose Shortest Paths

by   Jade Master, et al.

The composition problem for shortest paths asks the following: given shortest paths on weighted graphs M and N which share a common boundary, find the shortest paths on their union. This problem is a crucial step in any algorithm which uses the divide and conquer method to find shortest paths. This extended abstract details how this problem may be understood categorically. Finding shortest paths is represented by a functor and the composition problem asks to find the value of this functor on a pushout using the values of the functor on the components. Furthermore, we present an algorithm which solves the composition problem for shortest paths. When implemented in Python, this algorithm reduces the computation time for finding shortest paths by relying on precompilation.


page 1

page 2

page 3


Partially Disjoint k Shortest Paths

A solution of the k shortest paths problem may output paths that are ide...

An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model

We perform an experimental evaluation of algorithms for finding geodesic...

Generic and Efficient Solution Solves the Shortest Paths Problem in Square Runtime

We study a group of new methods to solve an open problem that is the sho...

A Survey of Algorithms for Geodesic Paths and Distances

Numerical computation of shortest paths or geodesics on curved domains, ...

Solve For Shortest Paths Problem Within Logarithm Runtime

The Shortest Paths Problem (SPP) is no longer unresolved. Just for a lar...

Shortest Paths in HSI Space for Color Texture Classification

Color texture representation is an important step in the task of texture...

Collaborative Uploading in Heterogeneous Networks: Optimal and Adaptive Strategies

Collaborative uploading describes a type of crowdsourcing scenario in ne...

Please sign up or login with your details

Forgot password? Click here to reset