Updating directed minimum cost spanning trees

Authors:
Gerasimos G. Pollatos;Orestis A. Telelis;Vassilis Zissimopoulos
Affiliations:
Dept. of Informatics and Telecommunications, University of Athens, Hellas, Greece;Dept. of Informatics and Telecommunications, University of Athens, Hellas, Greece;Dept. of Informatics and Telecommunications, University of Athens, Hellas, Greece
Venue:
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Year:
2006

Citing 9
Cited 0

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
On the computational complexity of dynamic graph problems

Theoretical Computer Science
Incremental evaluation of computational circuits

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithms for maintaining shortest paths trees

Journal of Algorithms
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM (JACM)
Configuration Compression for Virtex FPGAs

FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Configuration bitstream compression for dynamically reconfigurable FPGAs

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks

Mobile Networks and Applications
Proving simultaneous positivity of linear forms

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.