U.: Melding Priority Queues (2004)

by R Mendelson, R E Tarjan, M Thorup, Zwick
Venue:In Proc. of 9th SWAT
Add To MetaCart
Results 1 - 1 of 1

V.: Updating Directed Minimum Cost Spanning Trees

by Gerasimos G. Pollatos, Orestis A. Telelis, Vassilis Zissimopoulos - In: Proceedings of the 5th Workshop on Experimental Algorithms (WEA), Springer, LNCS , 2006
"... Abstract. We consider the problem of updating a directed minimum cost spanning tree (DMST), when edges are deleted from or inserted to a weighted directed graph. This problem apart from being a classic for directed graphs, is to the best of our knowledge a wide open aspect for the field of dynamic g ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. We consider the problem of updating a directed minimum cost spanning tree (DMST), when edges are deleted from or inserted to a weighted directed graph. This problem apart from being a classic for directed graphs, is to the best of our knowledge a wide open aspect for the field of dynamic graph algorithms. Our contributions include results on the hardness of updates, a dynamic algorithm for updating a DMST, and detailed experimental analysis of the proposed algorithm exhibiting a speedup factor of at least 2 in comparison with the static practice.