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

Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/270

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-16T10:52:41Z	-
dc.date.available	2018-02-16T10:52:41Z	-
dc.date.issued	2014-07	-
dc.identifier.uri	http://hdl.handle.net/20.500.12188/270	-
dc.description.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	en_US
dc.language.iso	en_US	en_US
dc.publisher	Vilnius University Press	en_US
dc.relation.ispartof	Olympiads in Informatics	en_US
dc.title	On Maximal Level Minimal Path Vectors of a Two-Terminal Network	en_US
dc.type	Journal Article	en_US
item.fulltext	With Fulltext	-
item.grantfulltext	open	-
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

File	Description	Size	Format
OLYMPIADS IN INFORMATICS 2014_On Maximal Level Minimal Path Vectors of a Two-Terminal Network.pdf		863.24 kB	Adobe PDF	View/Open

466

Last Week
0

Last month
4

checked on Nov 24, 2025

53

checked on Nov 24, 2025

Check