Results 1 to 10 of about 119,472 (328)
A distributed algorithm for directed minimum-weight spanning tree [PDF]
Distributed Computing, 2021 In the directed minimum spanning tree problem (DMST, also called minimum weight arborescence), we are given a directed weighted graph, and a root node r. Our goal is to construct a minimum-weight directed spanning tree, rooted at r and oriented outwards. We present the first sub-quadratic DMST algorithm in the distributed
Orr Fischer, Rotem Oshman
semanticscholar +8 more sources
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification [PDF]
Theory of Computing Systems, 2013 This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities of this problem.
Liah Kor, Amos Korman, David Peleg
semanticscholar +15 more sources
A Distributed Minimum Spanning Tree for Cognitive Radio Networks [PDF]
Procedia Computer Science, 2016 AbstractThe minimum spanning tree is a classical problem in distributed system environment. We extend this challenge in Cognitive Radio Networks (CRN). In CRN, the spectrum mobility and the node mobility creates connectivity problem during neighbour discovery. Thus, finding edges (or relation graph) between the SU nodes in order to create communication
Mahendra Kumar Murmu +3 more
semanticscholar +5 more sources
A distributed approximation algorithm for the minimum degree minimum weight spanning trees [PDF]
Journal of Parallel and Distributed Computing, 2007 Fischer has shown how to compute a minimum weight spanning tree of degree at most $b ^* + \lceil \log\_b n\rceil$ in time $O(n^{4 + 1/\ln b})$ for any constant $b > 1$, where $ ^*$ is the value of an optimal solution and $n$ is the number of nodes in the network. In this paper, we propose a distributed version of Fischer's algorithm that requires
Christian Lavault, Mario Valencia-Pabon
core +8 more sources
Awake Complexity of Distributed Minimum Spanning Tree
Colloquium on Structural Information & Communication Complexity, 2022 29 pages, 1 table, 5 figures, abstract modified to fit arXiv ...
John Augustine +2 more
semanticscholar +4 more sources
A Distributed Approach to Construct Minimum Spanning Tree in Cognitive Radio Networks
Procedia Computer Science, 2015 AbstractThe minimum spanning tree is useful for data disseminating or broadcasting where a leader node can regulate the data with minimum cost and time. The article presents an algorithm to construct minimum spanning tree in cognitive radio networks. The cognitive radio network works differently with single channel or multi-channel wireless networks ...
Mahendra Kumar Murmu
semanticscholar +4 more sources
A distributed algorithm for constructing a minimum diameter spanning tree [PDF]
Journal of Parallel and Distributed Computing, 2004 Comments: 11 pages LaTeX, 2 figures; International Journal with referees article; New version (full paper design): results added in Section 2.2 and 2.2; typos ...
Marc Bui +2 more
openalex +6 more sources
Distributed Minimum Degree Spanning Trees [PDF]
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019 The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree T for graph G, such that the maximum degree of T is the smallest among all spanning trees of G. Let d be this MDST degree for a given graph. In this paper, we present a randomized distributed approximation algorithm for the MDST problem that constructs a ...
Michael Dinitz +3 more
openalex +3 more sources
Energy Efficient Cluster Head Selection in Internet of Things Using Minimum Spanning Tree (EEMST)
Applied Artificial Intelligence, 2021 Internet of things network lifetime and energy issues are some of the most important challenges in today’s smart world. Clustering would be an effective solution to this, as all nodes would be arranged into virtual clusters, while one node will serve as ...
Vida Doryanizadeh +3 more
doaj +2 more sources
A faster distributed protocol for constructing a minimum spanning tree
Journal of Computer and System Sciences, 2006 AbstractThis paper studies the problem of constructing a minimum-weight spanning tree (MST) in a distributed network. This is one of the most important problems in the area of distributed computing. There is a long line of gradually improving protocols for this problem, and the state of the art today is a protocol with running time O(Λ(G)+n⋅log∗n) due ...
Michael Elkin
openalex +4 more sources