A Comparison of two Parallel Iterative Algorithms for Solving Path Problems
[摘要] 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....
[发布日期] [发布机构]
[效力级别] [学科分类] 计算机科学(综合)
[关键词] directed graphs;path problems;parallel algorithms;iterative methods;complexity;experiments [时效性]