Updating Directed Minimum Cost Spanning Trees

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 algor...

Full description

Saved in:
Bibliographic Details
Published inExperimental Algorithms pp. 291 - 302
Main Authors Pollatos, Gerasimos G., Telelis, Orestis A., Zissimopoulos, Vassilis
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
branchings
Computer science; control theory; systems
data structures
dynamic graph algorithms
Exact sciences and technology
Theoretical computing
Direct problem
Updating
Spanning tree
Algorithm analysis
Directed graph
Weighted graph
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783540345978
3540345973
ISSN:0302-9743
1611-3349
DOI:10.1007/11764298_27