Pettie & Ramachandran (APSP on Dense Undirected Graphs with Arbitrary Weights; APSP on Sparse Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(mn \log \alpha(m,n))$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Pointer Machine

Year

2002

Reference

https://dl.acm.org/citation.cfm?id=545417

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Pettie_%26_Ramachandran_(APSP_on_Dense_Undirected_Graphs_with_Arbitrary_Weights;_APSP_on_Sparse_Undirected_Graphs_with_Arbitrary_Weights_All-Pairs_Shortest_Paths_(APSP))&oldid=46980"