Results 291 to 300 of about 119,472 (328)
Some of the next articles are maybe not open access.
Revisiting search methods for the bounded-diameter minimum spanning tree problem
RAIRO - Operations ResearchThe Bounded-Di\-am\-e\-ter Minimum Spanning Tree Problem (BDMSTP) is defined as follows: Given a graph $G$ where each edge $xy$ has a positive cost $w_{xy}$, the goal is to find an optimal spanning tree of $G$ whose diameter does not exceed a prescribed ...
Isabel Rosseti +5 more
semanticscholar +1 more source
Efficient distributed algorithm to solve updating minimum spanning tree problem
Systems and Computers in Japan, 1992AbstractThis paper proposes a distributed algorithm for reconstructing a minimum‐weight spanning tree T′ of a network N′ when link addition and deletion occur in a network N with a minimum‐weight spanning tree T. In this algorithm each processor uses information whose adjacent links belong to T in order to construct T′ efficiently.
Nobuki Tokura +3 more
openaire +2 more sources
LT Codes and the Minimum Spanning Tree Based Distributed Storage in Wireless Sensor Networks
Journal on spesial topics in mobile networks and applications, 2019L. Meng +4 more
semanticscholar +1 more source
An Efficient Distributed Approach to Construct a Minimum Spanning Tree in Cognitive Radio Network
First International Conference on Sustainable Technologies for Computational Intelligence, 2019Deepak Rohilla +2 more
semanticscholar +1 more source
A Distributed Algorithm to Create a Minimum Spanning Tree in a Multi-channel Cognitive Radio Network
, 2019Deepak Rohilla, M. Murmu
semanticscholar +1 more source
Optimal distributed algorithm for minimum spanning trees revisited
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95, 1995Michalis Faloutsos, Mart Molle
openaire +2 more sources
Cancer risks associated with external radiation from diagnostic imaging procedures
Ca-A Cancer Journal for Clinicians, 2012Martha S Linet +2 more
exaly