A Comparison of two Parallel Iterative Algorithms for Solving Path Problems

CIT. Journal of Computing and Information Technology

Manger, Robert¹ 

[1] Department of Mathematics, University of Zagreb, Croatia

关键词: directed graphs;    path problems;    parallel algorithms;    iterative methods;    complexity;    experiments;   

DOI  :  

学科分类：计算机科学（综合）

来源: Sveuciliste u Zagrebu

【 摘 要 】

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....

【 授权许可】

Unknown