Please use this identifier to cite or link to this item:
Title: Maximal Level Minimal Path Vectors of a Two-Terminal Undirected Network
Authors: Mihova, Marija 
Stojkovikj, Natasha
Jovanov, Mile 
Stankov, Emil 
Issue Date: Mar-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Journal: IEEE Transactions on Reliability
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.
DOI: 10.1109/tr.2015.2420042
Appears in Collections:Faculty of Computer Science and Engineering: Journal Articles

Show full item record

Page view(s)

Last Week
Last month
checked on Feb 16, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.