scientific article; zbMATH DE number 1043917

MaRDI QIDQ4346819zbMATH OpenFDO

Authors Tadao Takaoka

Publication date 18 February 1998

zbMATH Keywords

pairs shortest path problem

Mathematics Subject Classification ID

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

Recommendations

• Two fast algorithms for all-pairs shortest paths
• A survey of the all-pairs shortest paths problem and its variants in graphs
• An Appraisal of Some Shortest-Path Algorithms
• Computing and Combinatorics
• All-Pairs Almost Shortest Paths
• Efficient parameterized algorithms for computing all-pairs shortest paths
• Efficient parameterized algorithms for computing all-pairs shortest paths
• On the all-pairs shortest path algorithm of Moffat and Takaoka
• A sharper analysis of a prallel algorithm for the all pairs shortest path problem
• scientific article; zbMATH DE number 986995

Cited in

(3)

• scientific article; zbMATH DE number 6469167 (Why is no real title available?)
• An algebraic decomposed algorithm for all pairs shortest paths
• A survey of the all-pairs shortest paths problem and its variants in 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 Q4346819)