scientific article

zbMATH Open0546.68047MaRDI QIDQ3336710

Günter Rote

Publication date: 1985

Title of this publication is not available (Why is that?)

zbMATH Keywords

parallel algorithmsmatrix inversionAlgebraic Path Problemtransitive closure of a relationGauß-Jordan eliminationhexagonal systolic arrayshortest distances in a networksystolic array algorithmWarshall- Floyd algorithmParallelizationsPartially complete semiringspipeline delay

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Semirings (16Y60) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (7)

Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution ⋮ An incremental mechanical development of systolic solutions to the algebraic path problem ⋮ A family of efficient regular arrays for algebraic path problem ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Derivation of systolic algorithms for the algebraic path problem by recurrence transformations ⋮ Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336710)