Fully Sequential and Distributed Dynamic Algorithms for Minimum Spanning Trees
Pradosh Kumar Mohapatra
Abstract
In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update efficiently the minimum spanning tree after dynamic changes like edge weight changes, rather than having to recompute it from scatch each time. The first part of the paper surveys various algorithms available today both in sequential and distributed environments to solve static MST problem. We also present some of the efficient sequential algorithms for computing dynamic MST like the Frederickson's algorithm and Eppstein's sparsification technique. Lastly we present our new sequential and distributed algorithms for dynamic MST problem. To our knowledge, this is the first of the distributed algorithms for computing dynamic MSTs.
Create a lesson
Related papers
Scheduling in Cloud,Fog, and Edge Computing: A Comparative Analysis and Decision Framework for Technique Selection
Rana Ghazali, Douglas G. Down
GPU-resident Execution for Timing-predictable Sensor Processing Systems
Soham Sinha, Rahul Choudhury, Shekhar Dwivedi et al.
CompileMask: Bridging the Gap Between Expressiveness and Efficiency in Attention Masking
Hongzheng Li, Jiacheng Wan, Zhaolong Xing et al.
ShoreKeeper: Accelerating Iterative Data Analytics in the Cloud via Distributed Recovery-Cost-Aware Caching
Jongseop Lee, Minsu Sun, Xinyue Ma et al.
Stacked Intelligent Metasurface-Based MultiModal Feature Fusion for Collaborative Inference in Edge Networks
Yushi Wang, Zhengxin Yu, Guhan Zheng et al.
Taking Tokenization off the Host for Agentic LLM Serving
Mohammad Siavashi, Pascal Schwinte, Ali Banaei et al.