Maintaining dynamic minimum spanning trees: An experimental study-Reference-Cited by-同舟云学术

Maintaining dynamic minimum spanning trees: An experimental study

Published:2010-03 Issue:5 Volume:158 Page:404-425
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Cattaneo G.,Faruolo P.,Petrillo U. Ferraro,Italiano G.F.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference39 articles.

1. An algorithm for the organization of information;Adelson-Veslkii;Doklady Akademi Nauk,1962

2. An empirical study of dynamic graph algorithms;Alberts;ACM Journal on Experimental Algorithmics,1997

3. D. Alberts, G. Cattaneo, G.F. Italiano, U. Nanni, C.D. Zaroliagis, A software library of dynamic graph algorithms, in: R. Battiti, A. Bertossi (Eds.), Proc. Algorithms and Experiments, ALEX 98, Trento, Italy, February 1998, pp. 129–136

4. Average case analysis of dynamic graph algorithms;Alberts;Algorithmica,1998

5. Maintaining information in fully dynamic trees with top trees;Alstrup;ACM Transactions on Algorithms,2005

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

1. On Querying Historical Connectivity in Temporal Graphs;Proceedings of the ACM on Management of Data;2024-05-29

2. Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs;Mathematics;2024-03-28

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

4. Fully Integrated Temporary Persistent Scatterer Interferometry;IEEE Transactions on Geoscience and Remote Sensing;2022

5. Efficient Computation and Visualization of Multiple Density-Based Clustering Hierarchies;IEEE Transactions on Knowledge and Data Engineering;2021-08-01