Path Problems In Networks

The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work.