Pregled bibliografske jedinice broj: 39964
A PVM Program for Solving Path Problems in Sparse Graphs
A PVM Program for Solving Path Problems in Sparse Graphs // Proceedings of the 21st International Conference on Information Technology Interfaces / Kalpić, Damir ; Dobrić Hljuz, Vesna (ur.).
Zagreb: Sveučilišni računski centar Sveučilišta u Zagrebu (Srce), 1999. str. 353-358 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 39964 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A PVM Program for Solving Path Problems in Sparse Graphs
Autori
Manger, Robert ; Nogo, Goranka
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 21st International Conference on Information Technology Interfaces
/ Kalpić, Damir ; Dobrić Hljuz, Vesna - Zagreb : Sveučilišni računski centar Sveučilišta u Zagrebu (Srce), 1999, 353-358
Skup
The 21st International Conference on
Information Technology Interfaces (ITI '99)
Mjesto i datum
Pula, Hrvatska, 15.06.1999. - 18.06.1999
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
directed graphs; path problems; sparsity; distributed computing; PVM
Sažetak
Path problems are a family of optimization and enumeration problems that reduce to generation or comparison of a paths in directed graphs. In this paper we present a computer program for solving path problems, which is based on the PVM package. Our solution is optimized for sparse graphs, and its speed is further increased by distributed computing. We list the results of experiments,where the program performance has been evaluated on randomly generated path problems.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
037010
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
