An Improved Distribution Algorithm for Shortest Paths Problem

DOI10.1109/TC.1984.1676503zbMATH Open0545.68059OpenAlexW2121915725MaRDI QIDQ3335005FDOQ3335005

Authors: G. D. Lakhani 

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1984.1676503

Recommendations

• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• A new upper bound on the complexity of the all pairs shortest path problem
• Improved algorithm for all pairs shortest paths
• Another adaptive distributed shortest path algorithm
• New Bounds on the Complexity of the Shortest Path Problem

zbMATH Keywords

distributed algorithmtime complexityVLSI layoutpipeliningsystolic architecturearea complexityall-pair shortest path problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (7)

• Improvements for the thresh X2 shortest path algorithm
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Title not available (Why is that?)
• A parallel algorithm for surface-based object reconstruction
• Title not available (Why is that?)
• Optimized versions of a distributed algorithm for solving path problems
• Improved distributed algorithms for exact shortest paths

This page was built for publication: An Improved Distribution Algorithm for Shortest Paths Problem

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