Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/252| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Mihova, Marija | en_US |
| dc.contributor.author | Stojkovikj, Natasha | en_US |
| dc.contributor.author | Jovanov, Mile | en_US |
| dc.contributor.author | Stankov, Emil | en_US |
| dc.date.accessioned | 2018-02-07T10:52:09Z | - |
| dc.date.available | 2018-02-07T10:52:09Z | - |
| dc.date.issued | 2016-03 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/252 | - |
| dc.description.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. | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
| dc.relation.ispartof | IEEE Transactions on Reliability | en_US |
| dc.title | Maximal Level Minimal Path Vectors of a Two-Terminal Undirected Network | en_US |
| dc.type | Journal Article | en_US |
| dc.identifier.doi | 10.1109/tr.2015.2420042 | - |
| dc.identifier.url | http://xplorestaging.ieee.org/ielx7/24/7422884/07084693.pdf?arnumber=7084693 | - |
| dc.identifier.volume | 65 | - |
| dc.identifier.issue | 1 | - |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| Appears in Collections: | Faculty of Computer Science and Engineering: Journal Articles | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.