Maintaining a minimum spanning tree under transient node failures (original) (raw)
Related papers
Nearly linear time minimum spanning tree maintenance for transient node failures
2004
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures
IEEE Transactions on Computers, 2012
A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges
ArXiv, 2019
Algorithms for updating minimal spanning trees
Journal of Computer and System Sciences, 1978
A New Approach to Find a Minimum Spanning Tree (NAFMST)
Distributed computation of all node replacements of a minimum spanning tree
Fully Sequential and Distributed Dynamic Algorithms for Minimum Spanning Trees
arXiv preprint cs/0002005, 2000
Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
Algorithmica, 1996
Optimal maintenance of a spanning tree
Journal of the ACM, 2008
Optimal algorithms for the vertex updating problem of a minimum spanning tree
Parallel Processing Symposium, 1992
A New Approach to Find a Minimum Spanning Tree (NAFMST) 1 Software Engineer OracleTech Pvt. Ltd
A Simple Distributed Algorithm for the Maintenance of a Spanning Tree
Proceedings VECoS, 2007
Lecture Notes in Computer Science
Maintenance of a minimum spanning forest in a dynamic plane graph
Robert Tarjan, Moti Yung, Jeffery Westbrook
Journal of Algorithms, 1992
Finding the most vital edges with respect to the number of spanning trees
IEEE Transactions on Reliability, 1994
On the PROBABILISTIC MIN SPANNING TREE problem
2010
The capacitated minimum spanning tree problem
Tdx, 2013
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs
European Journal of Operational Research, 2004
A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
Computers & Mathematics with Applications, 1998
Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015
Fast Self-Stabilizing Minimum Spanning Tree Construction
Computing Research Repository, 2010
A parallel algorithm for computing minimum spanning trees
1992
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
Lecture Notes in Computer Science, 2009
Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees
Algorithmica, 1993
The Weighted Spanning Tree Constraint Revisited
2010
An Efficient Algorithm to Reconstruct a Minimum Spanning Tree in an Asynchronous Distributed Systems
Proc. of the 17th Intl.Conf. on Advanced Computing & Communications, 14th-17th Dec. 2009, Bangalore, India, 2009
MINIMUM SPANNING TREE ALGORITHMS AND TECHNIQUES
IJCIRAS, 2019
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms, 2010
MINIMUM SPANNING TREE ALGORITHM: DESIGN AND ANALYSIS
Reoptimization of the minimum spanning tree
Wiley Interdisciplinary Reviews: Computational Statistics, 2011
2000
On finding spanning trees with few leaves
2008
2000
FORMULATIONS AND HEURISTICS FOR MINIMAL SPANNING TREES WITH MINIMUM DEGREE CONSTRAINTS
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM, 1995