On Maximal Level Minimal Path Vectors of a Two-Terminal Network

Abstract

The reliability of a two-terminal flow network with a discrete set of possible capacities for its arcs is usually computed in terms of minimal path or minimal cut vectors. This paper analyzes the connection between minimal path vectors a nd flow functions, which supports the development of an efficient algorithm that solves the problem of finding the set of all such vectors