scientific article; zbMATH DE number 3908469

MaRDI QIDQ3686746zbMATH OpenFDO

Authors Tadao Takaoka, Kempei Ko

Publication date 1984

zbMATH Keywords

algorithmshortest path problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
• A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time
• An \(O(n ^{3} \log\log n/\log ^{2} n)\) time algorithm for all pairs shortest paths
• A simpler algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time
• An O(n^3 n / ^2 n) time algorithm for all pairs shortest paths

Cited in

(6)

• An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
• A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time
• A simpler algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time
• An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
• scientific article; zbMATH DE number 913360 (Why is no real title available?)
• O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES 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 Q3686746)