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

Mihova, Marija; Stojkovikj, Natasha; Jovanov, Mile; Stankov, Emil

doi:10.1109/tr.2015.2420042

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

Journal

IEEE Transactions on Reliability

Date Issued

2016-03

Author(s)

Stojkovikj, Natasha

DOI

10.1109/tr.2015.2420042

Abstract

A two-terminal flow network is usually defined as a directed graph, or a digraph; but there are a number of applications where it is more natural to use an undirected graph. This paper analyzes the connection between minimal path vectors and flow functions in undirected networks, which supports the development of an efficient algorithm that solves the problem of finding the set of all such vectors.