Please use this identifier to cite or link to this item:
Title: On Maximal Level Minimal Path Vectors of a Two-Terminal Network
Authors: Mihova, Marija 
Stojkovikj, Natasha
Jovanov, Mile 
Stankov, Emil 
Issue Date: Jul-2014
Publisher: Vilnius University Press
Journal: Olympiads in Informatics
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
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 29, 2020


checked on Feb 29, 2020

Google ScholarTM


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