메뉴 건너뛰기




Volumn 34, Issue 3, 1985, Pages 191-219

A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)

Author keywords

Algebraic path problem; algorithms; AMS subject classifications: 68A05, (05C35, 05C38, 16A78, 65F05, 68E10; B.6.1 logic design :design styles cellular arrays; B.7.1 integrated circuits ; C.1.2 processor architectures : multiple data stream architectures (multiprocessors) systolic arrays; closed semirings; design; G. 1.0 numerical analysis : general parallel algorithms; G. 1.3 numerical analysis : numerical linear algebra matrix inversion; G. 2.2 discrete mathematics : graph theory path problems; Gau Jordan elimination; performance; shortest paths; transitive closure; types and design styles algorithms implemented in hardware; VLSI (very large scale integration)

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

EID: 0021865695     PISSN: 0010485X     EISSN: 14365057     Source Type: Journal    
DOI: 10.1007/BF02253318     Document Type: Article
Times cited : (82)

References (20)
  • 9
    • 0003067817 scopus 로고
    • Representation of events in nerve nets and finite automata
    • C., Shannon, J., McCarthy, Princeton University Press, Princeton (New Jersey)
    • (1956) Automata Studies , pp. 3-40
    • Kleene, S.C.1
  • 11
  • 14
    • 84936298160 scopus 로고    scopus 로고
    • Mahr, B.: Semirings and Transitive Closure. Technische Universität Berlin, Fachbereich 20, report 82-5 (1982).
  • 15
    • 84936257502 scopus 로고    scopus 로고
    • Mahr, B.: Iteration and summability in semirings. In: Burkard, R. E., Cuninghame-Green, R. A., Zimmermann, U. (eds.), Algebraic and Combinatorial Methods in Operations Research (Proceedings of the Workshop on Algebraic Structures in Operations Research, Bad Honnef, Federal Republic of Germany, April 13–17, 1982), Ann. Discrete Math. 19, 229–256 (1984).
  • 16
    • 84936284823 scopus 로고    scopus 로고
    • Rote, G.: A Systolic Array for the Algebraic Path Problem (which Includes the Inverse of a Matrix and Shortest Distances in a Graph). Rechenzentrum Graz, Bericht RZG-101 (1984).
  • 20
    • 0003387863 scopus 로고
    • Linear and combinatorial optimization in ordered algebraic structures. (Especially chapter 8: Algebraic path problems)
    • (1981) Ann. Discrete Math. , vol.10 , pp. 1-380
    • Zimmermann, U.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.