 |
 |
 |
Journal of computing and information technology, Vol.1 No.2 Lipanj 1993.
Izvorni znanstveni članak
Parallel Iterative Algorithms for Solving Path Problems
Robert Manger
; Department of Mathematics, University of Zagreb, Croatia
| Puni tekst: engleski, pdf (6 MB) | str. 99-110 | citiraj | |
|
APA 6th Edition Manger, R. (1993). Parallel Iterative Algorithms for Solving Path Problems. Journal of computing and information technology, 1 (2), 99-110. Preuzeto s https://hrcak.srce.hr/150504 MLA 8th Edition Manger, Robert. "Parallel Iterative Algorithms for Solving Path Problems." Journal of computing and information technology, vol. 1, br. 2, 1993, str. 99-110. https://hrcak.srce.hr/150504. Citirano 10.12.2018. Chicago 17th Edition Manger, Robert. "Parallel Iterative Algorithms for Solving Path Problems." Journal of computing and information technology 1, br. 2 (1993): 99-110. https://hrcak.srce.hr/150504 Harvard Manger, R. (1993). 'Parallel Iterative Algorithms for Solving Path Problems', Journal of computing and information technology, 1(2), str. 99-110. Preuzeto s: https://hrcak.srce.hr/150504 (Datum pristupa: 10.12.2018.) Vancouver Manger R. Parallel Iterative Algorithms for Solving Path Problems. Journal of computing and information technology [Internet]. 1993 [pristupljeno 10.12.2018.];1(2):99-110. Dostupno na: https://hrcak.srce.hr/150504 IEEE R. Manger, "Parallel Iterative Algorithms for Solving Path Problems", Journal of computing and information technology, vol.1, br. 2, str. 99-110, 1993. [Online]. Dostupno na: https://hrcak.srce.hr/150504. [Citirano: 10.12.2018.] |
|||
Sažetak
Path problems are a family of optimization and enumeration problems involving the determination of paths in directed graphs. In this paper few parallel iterative algorithms for solving path problems are developed. More precisely, the considered algorithms are parallelized counterparts of the classical iterative methods, such as Jacobi or Gauss-Seidel. The underlying model of computation is a tightly coupled multiprocessor. It is shown that the algorithms obtain the required solution after a finite number of iterations. For each algorithm, the computational complexity of a single iteration is estimated, and an upper bound for the number of iterations is established. On the basis of these results the algorithms are compared.
Hrčak ID: 150504
URI
https://hrcak.srce.hr/150504
Moj profil