4 search results - page 1 / 1 » Batch Dynamic Single-Source Shortest-Path Algorithms: An Exp... |
WEA
2009
Springer
13 years 11 months ago
2009
Springer
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...
JCP
2007
13 years 4 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
HPDC
2008
IEEE
13 years 5 months ago
2008
IEEE
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...