Parallel Algorithms for Network Routing Problems and Recurrences

DOI10.1137/0603039zbMath0491.68067OpenAlexW2032958473MaRDI QIDQ3953187

John A. Wisniewski, Ahmed H. Sameh

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027/uiuo.ark:/13960/t1pg38429

zbMATH Keywords

shortest path problemregular algebraanalysis of Fortran programs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On a routing problem
• Solving Triangular Systems on a Parallel Computer
• Revised Matrix Algorithms for Shortest Paths
• An Appraisal of Some Shortest-Path Algorithms
• An Algebra for Network Routing Problems
• Cellular arrays for the solution of graph problems