On the Parallel Computation of the Algebraic Path Problem

Abstract

The algebraic path problem is a general description of a class of problems, including some important graph problems such as transitive closure, all pairs shortest paths, minimum spanning tree, etc. In this paper, the algebraic path problem is solved on the processor array with a reconfigurable bus system. The proposed algorithms are based on repeated matrix… (More)
DOI: 10.1109/71.127265

3 Figures and Tables

Topics

  • Presentations referencing similar topics