Pregled bibliografske jedinice broj: 39954
Optimized Versions of a Distributed Algorithm for Solving Path problems
Optimized Versions of a Distributed Algorithm for Solving Path problems // Central European Journal of Operations Research - CEJOR, 8 (2000), 2; 109-123 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 39954 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Optimized Versions of a Distributed Algorithm for Solving Path problems
Autori
Manger, Robert ; Nogo, Goranka
Izvornik
Central European Journal of Operations Research -
CEJOR (1435-246X) 8
(2000), 2;
109-123
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
graph theory; path problems; distributed computing; parallel virtual machine (PVM); experiments
Sažetak
Path problems are a family of optimization and
enumeration problems that reduce to generation or comparison of paths in graphs. In this paper we present three optimized versions of a distributed algorithm for solving path problems. The new versions are faster then the original algorithm, but they are applicable only to certain instances of problems, i.e. to undirected, acyclic, and sparse graphs, respectively. We report on experiments, where the three versions have been implemented with PVM and evaluated on randomly generated problem instances.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
037010
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
Citiraj ovu publikaciju:
Časopis indeksira:
- EconLit
Uključenost u ostale bibliografske baze podataka::
- Mathematical Reviews
