DC Field | Value | Language |
dc.contributor.author | Mozil, Zakhar | |
dc.contributor.author | Vavruk, Yevhenii | |
dc.coverage.temporal | 23–25 November 2018, Lviv | |
dc.date.accessioned | 2020-06-09T07:07:21Z | - |
dc.date.available | 2020-06-09T07:07:21Z | - |
dc.date.created | 2018-11-22 | |
dc.date.issued | 2018-11-22 | |
dc.identifier.citation | Mozil Z. Selection of optimal path finding algorithm for data transmission in Distributed Systems / Zakhar Mozil, Yevhenii Vavruk // Litteris et Artibus : proceedings, 23–25 November 2018, Lviv. — Lviv : Lviv Politechnic Publishing House, 2018. — P. 30–36. — (10th International academic conference “Computer science & engineering 2018”). | |
dc.identifier.isbn | 978-966-941-294-2 | |
dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/51763 | - |
dc.description.abstract | Considered typical structure of the distributed system. Also considered problem of data
transmission in a multilevel distributed system. The criteria for optimal pathfinding algorithm are
selected and the optimal algorithm is chosen. There is described Bellman-Ford algorithm for finding
the path in the graph. | |
dc.format.extent | 30-36 | |
dc.language.iso | en | |
dc.publisher | Видавництво Львівської політехніки | |
dc.publisher | Lviv Politechnic Publishing House | |
dc.relation.ispartof | Litteris et Artibus : proceedings, 2018 | |
dc.subject | shortest pathfinding problem | |
dc.subject | optimal pathfinding | |
dc.subject | distributed system | |
dc.subject | graphs | |
dc.subject | Bellman-Ford algorithm | |
dc.title | Selection of optimal path finding algorithm for data transmission in Distributed Systems | |
dc.type | Conference Abstract | |
dc.rights.holder | © Національний університет “Львівська політехніка”, 2018 | |
dc.contributor.affiliation | Lviv Polytechnic National University | |
dc.format.pages | 7 | |
dc.identifier.citationen | Mozil Z. Selection of optimal path finding algorithm for data transmission in Distributed Systems / Zakhar Mozil, Yevhenii Vavruk // Litteris et Artibus : proceedings, 23–25 November 2018, Lviv. — Lviv : Lviv Politechnic Publishing House, 2018. — P. 30–36. — (10th International academic conference “Computer science & engineering 2018”). | |
dc.relation.references | [1] Pradesh M. Modified Dijkstra’s Algorithm for Dense Graphs / Madhua Pradesh., 2016. | |
dc.relation.references | [2] Krianto S. O. Bellman Ford algorithm in Routing Information Protocol / Sulaiman Oris Krianto., 2017. | |
dc.relation.referencesen | [1] Pradesh M. Modified Dijkstra’s Algorithm for Dense Graphs, Madhua Pradesh., 2016. | |
dc.relation.referencesen | [2] Krianto S. O. Bellman Ford algorithm in Routing Information Protocol, Sulaiman Oris Krianto., 2017. | |
dc.citation.conference | 8th International youth science forum «Litteris et Artibus» | |
dc.citation.journalTitle | Litteris et Artibus : proceedings | |
dc.citation.spage | 30 | |
dc.citation.epage | 36 | |
dc.coverage.placename | Львів | |
dc.coverage.placename | Lviv | |
Appears in Collections: | Litteris et Artibus. – 2018 р.
|