APSP on Sparse Undirected Graphs with Positive Integer Weights

In this case, the graph $G=(V,E)$ that we consider is sparse ( $m = O(n)$ ), is undirected, and has positive integer weights.

Parameters

$n$ : number of vertices
$m$ : number of edges

Related Problems

APSP on Dense Undirected Graphs with Positive Integer Weights

APSP on Sparse Undirected Graphs with Positive Integer Weights

Approximate Distance Oracle

Directed, Weighted APSP

Undirected, Weighted APSP

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 1 of 1 algorithms

				See more
Thorup	1999	$O(mn)$	$O(m)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table