hrcak mascot   Srce   HID

Izvorni znanstveni članak

A Comparison of two Parallel Iterative Algorithms for Solving Path Problems

Robert Manger ; Department of Mathematics, University of Zagreb, Croatia

Puni tekst: engleski, pdf (5 MB) str. 75-85 preuzimanja: 180* citiraj
APA 6th Edition
Manger, R. (1996). A Comparison of two Parallel Iterative Algorithms for Solving Path Problems. Journal of computing and information technology, 4 (2), 75-85. Preuzeto s https://hrcak.srce.hr/150293
MLA 8th Edition
Manger, Robert. "A Comparison of two Parallel Iterative Algorithms for Solving Path Problems." Journal of computing and information technology, vol. 4, br. 2, 1996, str. 75-85. https://hrcak.srce.hr/150293. Citirano 01.03.2021.
Chicago 17th Edition
Manger, Robert. "A Comparison of two Parallel Iterative Algorithms for Solving Path Problems." Journal of computing and information technology 4, br. 2 (1996): 75-85. https://hrcak.srce.hr/150293
Harvard
Manger, R. (1996). 'A Comparison of two Parallel Iterative Algorithms for Solving Path Problems', Journal of computing and information technology, 4(2), str. 75-85. Preuzeto s: https://hrcak.srce.hr/150293 (Datum pristupa: 01.03.2021.)
Vancouver
Manger R. A Comparison of two Parallel Iterative Algorithms for Solving Path Problems. Journal of computing and information technology [Internet]. 1996 [pristupljeno 01.03.2021.];4(2):75-85. Dostupno na: https://hrcak.srce.hr/150293
IEEE
R. Manger, "A Comparison of two Parallel Iterative Algorithms for Solving Path Problems", Journal of computing and information technology, vol.4, br. 2, str. 75-85, 1996. [Online]. Dostupno na: https://hrcak.srce.hr/150293. [Citirano: 01.03.2021.]

Sažetak
Path problems are a family of optimization and enumeration problems posed on a directed graph. General algorithms for solving path problems can be designed as counterparts of the traditional iterative methods for solving linear systems. In this paper two parallel iterative Gauss-Seidel-like algorithms for solving path problems arc compared. Theoretical results are listed, which estimate the computational complexity of both algorithms. Experiments are presented, where the algorithms have been tested on randomly generated graphs and with different numbers of available processors. Some situations are identified, where one of the algorithms becomes superior to the other.

Ključne riječi
directed graphs; path problems; parallel algorithms; iterative methods; complexity; experiments

Hrčak ID: 150293

URI
https://hrcak.srce.hr/150293

Posjeta: 238 *