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

Mihova, Marija and Stojkovic, Natasa and Jovanov, Mile and Stankov, Emil (2014) On Maximal Level Minimal Path Vectors of a Two-Terminal Network. Olympiads in Informatics, 8. pp. 133-144. ISSN 1822-7732 (Print) 2335-8955 (Online)

[thumbnail of v8_2014_133_144.pdf]

Download (883kB) | Preview


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 and flow functions, which supports the development of an
efficient algorithm that solves the problem of finding the set of all such vectors.

Item Type: Article
Subjects: Natural sciences > Computer and information sciences
Natural sciences > Matematics
Divisions: Faculty of Computer Science
Depositing User: Natasa Stojkovik
Date Deposited: 04 May 2015 10:04
Last Modified: 04 May 2015 10:04
URI: https://eprints.ugd.edu.mk/id/eprint/13116

Actions (login required)

View Item View Item