
Path problems are a family of optimization and enumeration problems that reduce to determination or evaluation of paths in a directed graph. In this paper we give a convenient algebraic description of block algorithms for solving path problems. We also develop block versions of two Gaussian algorithms, which are counterparts of the conventional Jordan and escalator method respectively. The correctness of the two considered block algorithms is discussed, and their complexity is analyzed. A parallel implementation of the block Jordan algorithm on a transputer network is presented, and the obtained experimental results are listed.
block algorithms, path algebras, parallel computing, path problems; path algebras; block algorithms; Gaussian elimination; parallel computing, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, path problems, Distributed algorithms, Gaussian elimination, network reliability, path algebra, Direct numerical methods for linear systems and matrix inversion
block algorithms, path algebras, parallel computing, path problems; path algebras; block algorithms; Gaussian elimination; parallel computing, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, path problems, Distributed algorithms, Gaussian elimination, network reliability, path algebra, Direct numerical methods for linear systems and matrix inversion
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
