Sciweavers

16 search results - page 1 / 4
» Single source shortest paths in H-minor free graphs
Sort
View
WEA
2009
Springer
145views Algorithms» more  WEA 2009»
13 years 10 months ago
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
Reinhard Bauer, Dorothea Wagner
HIPC
2007
Springer
13 years 9 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan
STACS
2010
Springer
13 years 10 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
ACSC
2007
IEEE
13 years 10 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka