scientific article; zbMATH DE number 62663

MaRDI QIDQ4008403zbMATH OpenFDO

Authors Ma Jun, Tadao Takaoka

Publication date 27 September 1992

zbMATH Keywords

parallel algorithmtime complexityweighted directed graphreflexive transitive closureall shortest paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Efficient parallel algorithms for computing all pair shortest paths in directed graphs
• scientific article; zbMATH DE number 1186513
• scientific article; zbMATH DE number 278831
• A sharper analysis of a prallel algorithm for the all pairs shortest path problem
• Optimal parallel algorithm for shortest-paths problem on interval graphs

This page was built for publication:

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