Journal ArticleDOI
Linear time distributed swap edge algorithms
Reads0
Chats0
TLDR
A novel technique is presented that addresses the all best swap edges problem in a distributed environment from a time perspective that works in linear time with respect to the height h of T for a number of different criteria, while retaining the optimal number of messages.About:
This article is published in Information Processing Letters.The article was published on 2020-09-01. It has received 4 citations till now. The article focuses on the topics: Spanning tree & Time complexity.read more
Citations
More filters
Proceedings ArticleDOI
Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
Mohsen Ghaffari,Merav Parter +1 more
TL;DR: The time complexity of the algorithms presented are nearly optimal in the following strong sense: they almost match even the lower bounds of constructing (basic) BFS and MST trees.
Book ChapterDOI
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges
TL;DR: This paper solves the ABSE problem for the case in which T is a single-source shortest-path tree of G, and two selected swap criteria aim to minimize either the maximum or the average stretch in the swap tree of all the paths emanating from the source.
Proceedings ArticleDOI
Distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree
TL;DR: This is the first known deterministic distributed algorithm for constructing a low stretch tree that is also edge fault-tolerant and makes it robust against edge failures by finding a swap edge for every edge in the constructed tree.
Book
Mathematical foundations of computer science 2010 : 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010 : proceedings
Petr Hliněný,Antonín Kučera +1 more
TL;DR: Proceedings of 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010) describe the research in this area and present some new ideas on how to integrate the explicit and the implicit.
References
More filters
Book
Design and Analysis of Distributed Algorithms
TL;DR: The aim of this monograph is to provide a history of distributed computing in the context of elections, as well as some of the techniques used to design and implement these networks.
BookDOI
Mathematical Foundations of Computer Science 2010
Petr Hliněný,Antonín Kučera +1 more
TL;DR: In this article, the authors present the results of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010) and present the corresponding proceedings.
Journal ArticleDOI
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast
TL;DR: This paper presents efficient algorithms for the problem of finding a best swap edge, for each edge e of S(r) , with respect to several objectives.
Journal ArticleDOI
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
Aleksej Di Salvo,Guido Proietti +1 more
TL;DR: An O(mlog2n) time and O(m) space algorithm is presented to find a best swap edge for every edge of T, thus improving for m=o(n2/log 2n) the previously known O( n2)Time and space complexity algorithm.
Journal ArticleDOI
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively
TL;DR: This work presents two simple and efficient distributed algorithms for computing the optimal swap edges of a shortest-path tree, one of which uses messages containing a constant amount of information, while the other is tailored for systems that allow long messages.