Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study-Reference-Cited by-同舟云学术

Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study

Published:2009 Issue: Volume: Page:51-62
ISSN:0302-9743
Container-title:Experimental Algorithms
language:
Short-container-title:

Author:

Bauer Reinhard,Wagner Dorothea

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02011-7_7

Reference20 articles.

1. Bauer, R., Wagner, D.: Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study. Technical Report 2009, 6, ITI Wagner, Faculty of Informatics, Universität Karlsruhe, TH (2009), http://digbib.ubka.uni-karlsruhe.de/volltexte/1000010926

2. Narváez, P., Siu, K.Y., Tzeng, H.Y.: New Dynamic Algorithms for Shortest Path Tree Computation. IEEE/ACM Transactions on Networking 8, 734–746 (2000)

3. Bruera, F., Cicerone, S., D’Angelo, G., Stefano, G.D., Frigioni, D.: Dynamic Multi-level Overlay Graphs for Shortest Paths. Mathematics in Computer Science (2008) (to appear)

4. Lecture Notes in Computer Science;D. Delling,2007

5. Lecture Notes in Computer Science,2007

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide;ACM Journal of Experimental Algorithmics;2022-12-13

2. Accelerated butterfly counting with vertex priority on bipartite graphs;The VLDB Journal;2022-05-16

3. A Parallel Algorithm Template for Updating Single-Source Shortest Paths in Large-Scale Dynamic Networks;IEEE Transactions on Parallel and Distributed Systems;2022-04-01

4. Maintaining Constrained Path Problem for Directed Acyclic Graphs;Journal of Interconnection Networks;2021-09

5. Finding all Pareto optimal paths by simulating ripple relay race in multi-objective networks;Swarm and Evolutionary Computation;2021-07