Pregled bibliografske jedinice broj: 3820
Correctness of a distributed algorithm for solving path problems
Correctness of a distributed algorithm for solving path problems // Proceedings of the 19th international conference on information technology interfaces / Kalpic, Damir ; Hljuz Dobric, Vesna ; (ur.).
Pula, Hrvatska: University Computing Centre, Zagreb, 1997. str. 363-368 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 3820 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Correctness of a distributed algorithm for solving path problems
Autori
Manger, Robert
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 19th international conference on information technology interfaces
/ Kalpic, Damir ; Hljuz Dobric, Vesna ; - : University Computing Centre, Zagreb, 1997, 363-368
Skup
The 19th International Conference on Information Technology Interfaces (ITI"97)
Mjesto i datum
Pula, Hrvatska, 17.06.1997. - 20.06.1997
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
graphs; path problems; parallel algorithms; distributed memory
Sažetak
Path problems are a family of optimization and enumeration problems which reduce to determination of paths in a graph. In this paper we propose a distributed algorithm for solving path problems. The algorithm is designed to run on a ring of processors with private memories. We prove the correctness of the proposed algorithm.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
037010
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
Profili:
Robert Manger
(autor)
