Mihova, Marija and Stojkovic, Natasa and Jovanov, Mile and Stankov, Emil (2016) Maximal Level Minimal Path Vectors of a Two-Terminal Undirected Network. Reliability, IEEE Transaction on, PP (99). pp. 1-9. ISSN 0018-9529
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/7084693/
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
| Item Type: | Article |
|---|---|
| Additional Information: | Impact factor 2.287 |
| Subjects: | Natural sciences > Computer and information sciences Natural sciences > Matematics |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Natasa Stojkovik |
| Date Deposited: | 16 Dec 2015 14:34 |
| Last Modified: | 05 Nov 2019 07:21 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/14570 |
Actions (login required)
 |
View Item |