Implementations and Experimental Studies of Dynamic Graph Algorithms-Reference-Cited by-同舟云学术

Implementations and Experimental Studies of Dynamic Graph Algorithms

Published:2002 Issue: Volume: Page:229-278
ISSN:0302-9743
Container-title:Experimental Algorithmics
language:
Short-container-title:

Author:

Zaroliagis Christos D.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36383-1_11

Reference65 articles.

1. Lect Notes Comput Sci;S. Abdeddaim,1997

2. S. Abdeddaim. Algorithms and experiments on transitive closure, path cover and multiple sequence alignment. In Proceedings of the 2nd Workshop on Algorithm Engineering and Experiments (ALENEX’00), pages 157–169, 2000.

3. D. Alberts, G. Cattaneo, and G. F. Italiano. An empirical studyof dynamic graph algorithms. ACM Journal of Experimental Algorithmics, 2:5, 1997. Preliminaryv ersion in Proceedings of SODA’96.

4. G. Amato, G. Cattaneo, and G. F. Italiano. Experimental analy sis of dynamic minimum spanning tree algorithms. In Proceedings of the 8th ACMSIAM Symposium on Discrete Algorithms (SODA’97), pages 314–323, 1997.

5. D. Alberts, G. Cattaneo, G.F. Italiano, U. Nanni, and C. Zaroliagis. A software libraryof dynamic graph algorithms. In Proceedings of the Workshop on Algorithms and Experiments (ALEX’98), pages 129–136, 1998.

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

1. Evaluating the importance of dynamic allocation and routing of rescuers in reducing response time;Journal of Geomatics Science and Technology;2023-01-01

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

3. Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info;International Journal of Foundations of Computer Science;2019-09

4. Fully Dynamic Connectivity;Encyclopedia of Algorithms;2016

5. Fully Dynamic Connectivity;Encyclopedia of Algorithms;2015