scientific article; zbMATH DE number 1979485

MaRDI QIDQ4425938zbMATH OpenFDO

Authors Seth Pettie

Publication date 14 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180032.htm

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2119672
• scientific article; zbMATH DE number 219247
• Algorithms and Data Structures
• New Bounds on the Complexity of the Shortest Path Problem
• Improved algorithm for all pairs shortest paths

Cited in

(6)

• A new approach to all-pairs shortest paths on real-weighted graphs
• All-pairs shortest paths with a sublinear additive error
• New Bounds on the Complexity of the Shortest Path Problem
• scientific article; zbMATH DE number 219247 (Why is no real title available?)
• scientific article; zbMATH DE number 2119672 (Why is no real title available?)
• Directed shortest paths via approximate cost balancing

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 Q4425938)