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

Journal
Olympiads in Informatics
Date Issued
2014-07
Author(s)
Stojkovikj, Natasha
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
File(s)
Loading...
Thumbnail Image
Name

OLYMPIADS IN INFORMATICS 2014_On Maximal Level Minimal Path Vectors of a Two-Terminal Network.pdf

Size

863.24 KB

Format

Adobe PDF

Checksum

(MD5):bc6c7e169893ba3d3fef0a376f1f0771