Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис:
http://hdl.handle.net/20.500.12188/270
Наслов: | On Maximal Level Minimal Path Vectors of a Two-Terminal Network | Authors: | Mihova, Marija Stojkovikj, Natasha Jovanov, Mile Stankov, Emil |
Issue Date: | јул-2014 | Publisher: | Vilnius University Press | Journal: | Olympiads in Informatics | 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 | URI: | http://hdl.handle.net/20.500.12188/270 |
Appears in Collections: | Faculty of Computer Science and Engineering: Journal Articles |
Files in This Item:
File | Опис | 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 |
Page view(s)
162
Last Week
0
0
Last month
4
4
checked on 25.7.2024
Download(s)
34
checked on 25.7.2024
Google ScholarTM
Проверете
Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.