Parallel Algorithms for Network Routing Problems and Recurrences

DOI10.1137/0603039MaRDI QIDQ3953187zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Parallel algorithms for solving aggregated shortest-path problems
• scientific article; zbMATH DE number 56471
• scientific article; zbMATH DE number 3870611
• Parallel Algorithms for Dynamic Shortest Path Problems
• scientific article; zbMATH DE number 4003535

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3231694 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An Algebra for Network Routing Problems
• An Appraisal of Some Shortest-Path Algorithms
• Cellular arrays for the solution of graph problems
• On a routing problem
• Revised Matrix Algorithms for Shortest Paths
• Solving Triangular Systems on a Parallel Computer

Cited in

(7)

• A Parallel Routing Algorithm for Traffic Optimization
• Computational and Information Science
• Recursive construction of parallel distribution networks
• A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
• A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
• Efficient Parallel Routing Algorithms for Cartesian and Composition Networks

This page was built for publication: Parallel Algorithms for Network Routing Problems and Recurrences

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