Optimized versions of a distributed algorithm for solving path problems

MaRDI QIDQ5949872zbMATH OpenFDO

Authors Robert Manger, Goranka Nogo

Publication date 5 December 2001

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

algorithmenumerationoptimizationparallel virtual machinepath problems

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1368817
• scientific article; zbMATH DE number 1810469
• scientific article; zbMATH DE number 735432
• An Improved Distribution Algorithm for Shortest Paths Problem
• scientific article; zbMATH DE number 966593

Cited in

(8)

• On the complexity of optimal parallel cooperative path-finding
• Algorithmic techniques for several optimization problems regarding distributed systems with tree topologies
• Qualitative investigation of path problems
• A percentile system optimization approach with and without path enumeration
• scientific article; zbMATH DE number 2036580 (Why is no real title available?)
• scientific article; zbMATH DE number 1368817 (Why is no real title available?)
• Improved distributed algorithms for exact shortest paths
• A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem

This page was built for publication: Optimized versions of a distributed algorithm for solving path problems

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