Results 11  20
of
615
AllPairs Shortest Paths and the Essential Subgraph
, 1995
"... The essential subgraph H of a weighted graph or digraph G contains an edge (v, w) if that edge is uniquely the leastcost path between its vertices. Let s denote the number of edges of H. This paper presents an algorithm for solving allpairs shortest paths on G that requires O(ns + n 2 log n) wor ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
The essential subgraph H of a weighted graph or digraph G contains an edge (v, w) if that edge is uniquely the leastcost path between its vertices. Let s denote the number of edges of H. This paper presents an algorithm for solving allpairs shortest paths on G that requires O(ns + n 2 log n
On the ComparisonAddition Complexity of AllPairs Shortest Paths
 In Proc. 13th Int'l Symp. on Algorithms and Computation (ISAAC'02
, 2002
"... We present an allpairs shortest path algorithm for arbitrary graphs that performs O(mn log (m; n)) comparison and addition operations, where m and n are the number of edges and vertices, resp., and is Tarjan's inverseAckermann function. Our algorithm eliminates the sorting bottleneck inherent ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We present an allpairs shortest path algorithm for arbitrary graphs that performs O(mn log (m; n)) comparison and addition operations, where m and n are the number of edges and vertices, resp., and is Tarjan's inverseAckermann function. Our algorithm eliminates the sorting bottleneck
On the Quantum Query Complexity of AllPairs Shortest Paths
"... We show lower bounds for the quantum query complexity of the allpairs shortest paths problem (APSP) for nonnegatively weighted directed graphs (digraphs), both in the adjacency matrix model and in an adja ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show lower bounds for the quantum query complexity of the allpairs shortest paths problem (APSP) for nonnegatively weighted directed graphs (digraphs), both in the adjacency matrix model and in an adja
An optimal algorithm to solve the allpairs shortest paths on unweighted interval graphs
 Networks
, 1992
"... We present an O(n2) timeoptimal algorithm for solving the unweighted allpair shortest path problem on interval graphs, an important subclass of perfect graphs. An interesting structure called the neighborhood tree is studied and used in the algorithm. This tree is formed by identifying the success ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We present an O(n2) timeoptimal algorithm for solving the unweighted allpair shortest path problem on interval graphs, an important subclass of perfect graphs. An interesting structure called the neighborhood tree is studied and used in the algorithm. This tree is formed by identifying
FASTER ALGORITHMS FOR ALLPAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS
, 2006
"... Let G = (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate ˆ δ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t iff δ(u, v) ≤ ˆ δ(u, v) ≤ t · δ(u, v). Computing allpairs small stretch distances efficiently (both in terms of time ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Let G = (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate ˆ δ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t iff δ(u, v) ≤ ˆ δ(u, v) ≤ t · δ(u, v). Computing allpairs small stretch distances efficiently (both in terms of time
ExternalMemory Exact and Approximate AllPairs ShortestPaths in Undirected Graphs
, 2004
"... We present several new externalmemory algorithms for finding allpairs shortest paths in a Vnode, Eedge undirected graph. For allpairs shortest paths and diameter in unweighted undirected graphs we present cacheoblivious algorithnls with O(V. ~ log. ~ ~) I/Os, where B is the blocksize and M is ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present several new externalmemory algorithms for finding allpairs shortest paths in a Vnode, Eedge undirected graph. For allpairs shortest paths and diameter in unweighted undirected graphs we present cacheoblivious algorithnls with O(V. ~ log. ~ ~) I/Os, where B is the blocksize and M
ExternalMemory Exact and Approximate AllPairs ShortestPaths in Undirected Graphs *
, 2004
"... Abstract We present several new externalmemory algorithms for finding allpairs shortest paths in a Vnode, Eedge undirected graph. Our results include the following, where B is the blocksize and Mis the size of internal memory. We present cacheoblivious algorithms with O( V * EB log MB EB) I/Os ..."
Abstract
 Add to MetaCart
/Os for allpairs shortest paths and diameter in unweighted undirected graphs. For weighted undirected graphs we present a cacheaware APSP algorithm that performs O(V * (q V EB + EB log VB)) I/Os. We also present efficient cacheaware algorithms that find paths between all pairs of vertices in anunweighted
Dynamic Approximate AllPairs Shortest Paths in Undirected Graphs
"... Abstract We obtain three new dynamic algorithms for the approximate allpairs shortest paths problem in unweighted undirected graphs: 1. For any fixed " ? 0, a decremental algorithm withan expected total running time of ~O(mn), where m is the number of edges and n is the number of vertice ..."
Abstract
 Add to MetaCart
Abstract We obtain three new dynamic algorithms for the approximate allpairs shortest paths problem in unweighted undirected graphs: 1. For any fixed " ? 0, a decremental algorithm withan expected total running time of ~O(mn), where m is the number of edges and n is the number of ver
External Memory Algorithms for Diameter and AllPairs ShortestPaths on Sparse Graphs
"... Abstract. We provide I/Oefficient algorithms for diameter and allpairs shortestpaths (APSP) on undirected graphs G(V, E). For general nonnegative edge weights and E/V = o(B / log V) our approaches are the first to achieve o(V 2) I/Os. We also show that unweighted APSP can be solved with just O(V ..."
Abstract
 Add to MetaCart
Abstract. We provide I/Oefficient algorithms for diameter and allpairs shortestpaths (APSP) on undirected graphs G(V, E). For general nonnegative edge weights and E/V = o(B / log V) our approaches are the first to achieve o(V 2) I/Os. We also show that unweighted APSP can be solved with just O
Results 11  20
of
615