2014
DOI: 10.1007/978-3-319-07959-2_24
|View full text |Cite
|
Sign up to set email alerts
|

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Dynamic SSSP algorithms recompute distances from a source node after a single edge update or a batch of edge updates. Algorithms for the batch problem have been published [24,13,3] and compared in experimental studies [3,10]. The experiments show that the tuned algorithm T-SWSF [3] performs well on many types of graphs and edge updates.…”
Section: Introductionmentioning
confidence: 99%
“…Dynamic SSSP algorithms recompute distances from a source node after a single edge update or a batch of edge updates. Algorithms for the batch problem have been published [24,13,3] and compared in experimental studies [3,10]. The experiments show that the tuned algorithm T-SWSF [3] performs well on many types of graphs and edge updates.…”
Section: Introductionmentioning
confidence: 99%
“…Dynamic approaches to update graphs and corresponding (compact) representations of transitive closures have been investigated in the past, in other application domains, due to the effectiveness of such structures for retrieving graph properties [15][16][17][18][19][20][21][22]. However, none of these can be directly employed in the PTL case, where time constraints imposed by the time-expanded graph add a further level of complexity to the involved data structures.…”
Section: Motivationmentioning
confidence: 99%
“…Dynamic SSSP algorithms recompute distances from a source node after a single edge update or a batch of edge updates. Algorithms for the batch problem have been published [17,7,2] and compared in experimental studies [2,6]. The experiments show that the tuned algorithm T-SWSF presented in [2] performs well on many types of graphs and edge updates.…”
Section: Batch Dynamic Sssp Algorithmsmentioning
confidence: 99%