PROJECT TITLE :

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

ABSTRACT:

A 2-terminal flow network is sometimes defined as a directed graph, or a digraph; but there are a variety of applications where it's additional natural to use an undirected graph. This paper analyzes the association between minimal path vectors and flow functions in undirected networks, that supports the development of an economical algorithm that solves the problem of finding the set of all such vectors.