Skip navigation

putin IS MURDERER

Please use this identifier to cite or link to this item: https://oldena.lpnu.ua/handle/ntb/51763
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMozil, Zakhar
dc.contributor.authorVavruk, Yevhenii
dc.coverage.temporal23–25 November 2018, Lviv
dc.date.accessioned2020-06-09T07:07:21Z-
dc.date.available2020-06-09T07:07:21Z-
dc.date.created2018-11-22
dc.date.issued2018-11-22
dc.identifier.citationMozil 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.isbn978-966-941-294-2
dc.identifier.urihttps://ena.lpnu.ua/handle/ntb/51763-
dc.description.abstractConsidered 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.extent30-36
dc.language.isoen
dc.publisherВидавництво Львівської політехніки
dc.publisherLviv Politechnic Publishing House
dc.relation.ispartofLitteris et Artibus : proceedings, 2018
dc.subjectshortest pathfinding problem
dc.subjectoptimal pathfinding
dc.subjectdistributed system
dc.subjectgraphs
dc.subjectBellman-Ford algorithm
dc.titleSelection of optimal path finding algorithm for data transmission in Distributed Systems
dc.typeConference Abstract
dc.rights.holder© Національний університет “Львівська політехніка”, 2018
dc.contributor.affiliationLviv Polytechnic National University
dc.format.pages7
dc.identifier.citationenMozil 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.conference8th International youth science forum «Litteris et Artibus»
dc.citation.journalTitleLitteris et Artibus : proceedings
dc.citation.spage30
dc.citation.epage36
dc.coverage.placenameЛьвів
dc.coverage.placenameLviv
Appears in Collections:Litteris et Artibus. – 2018 р.

Files in This Item:
File Description SizeFormat 
2018_Mozil_Z-Selection_of_optimal_path_finding_30-36.pdf69.77 kBAdobe PDFView/Open
2018_Mozil_Z-Selection_of_optimal_path_finding_30-36__COVER.png366.98 kBimage/pngView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.