Path Problems in Networks

The algebraic path problem is a generalization of the shortest path problem in graphs. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path problem, and an exposition of a broad range of applications.