scientific article; zbMATH DE number 3870611
zbMATH Open0546.68047MaRDI QIDQ3336710FDOQ3336710
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
parallel algorithmsmatrix inversionAlgebraic Path Problemtransitive closure of a relationhexagonal systolic arrayshortest distances in a networksystolic array algorithmWarshall- Floyd algorithmGauß-Jordan eliminationParallelizationsPartially complete semiringspipeline delay
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Semirings (16Y60)
Cited In (15)
- Parallel Algorithms for Network Routing Problems and Recurrences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
- An orthogonal systolic array for the algebraic path problem
- Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution
- Title not available (Why is that?)
- 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)
