A Distributed Parallel Algorithm for the Minimum Spanning Tree Problem

Mazeev, Artem; Семенов, А. А.; Simonov, Alexey

doi:10.1007/978-3-319-67035-5_8

Cited by 7 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is said of the optimizing work in today, justly our thought is not distinct to past for example the Fabonacci heap or Soft heap (was designed by Bernard Chazelle in 2000) and so forth, that attempted to reduce the effort of accessing to the data. The [11] has done useful work at this aspect which by integrating and strengthening hardware and communication to optimize practical tactic.…”

Section: Discussionmentioning

confidence: 99%

Study Morphology of Minimum Spanning Tree Problem and Generalized Algorithms

Tan

2017

Preprint

View full text Add to dashboard Cite

In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken successful to better equilibrium the benefits of local and global when we employ the strategy of divide and conquer to optimize solutions on problem. Under new model, we let the course of clustering become more transparent with many details, so that the whole solution may be featured of much reasonable, flexibility, efficiency and approach to reveal or reflect the reality. There are some important methods and avenues as fruits derived from discussions or trial which can be broad usefulness in the fields of graphic analysis, data mining, k-means clustering problem and so forth.

show abstract

Section: Discussionmentioning

confidence: 99%

Study Morphology of Minimum Spanning Tree Problem and Generalized Algorithms

Tan

2017

Preprint

View full text Add to dashboard Cite

show abstract

“…The purpose of electing a leader in an interconnected network is to permit the control of the network by a unique node in order to perform a specific action or activity with the other members of the network. Several algorithms have been proposed to solve this problem such as [5], [6]. Only a few of the proposed algorithms can be applied to MANETs.…”

Section: Introductionmentioning

confidence: 99%

Modeling and Verifying Leader Election Algorithm in CSP (S)

Fang¹,

Zhu²,

Wang³

2018

International Conferences on Software Engineering and Knowledge Engineering

View full text Add to dashboard Cite

Leader election is a fundamental problem in distributed systems and has a variety of applications in wireless networks, such as key distribution, routing coordination, and general control. The main statement of the leader election problem is to eventually elect a unique leader from a fixed set of nodes. As the wireless network is becoming more and more important in daily life, leader election algorithm plays a vital important role in wireless network, which makes the correctness and robustness of such algorithms become evermore important and challenging to establish. In this paper, firstly, we study an election algorithm LE for MANETs (Mobile Ad Hoc Network) designed by Vasudevan et al. Then we present a formal model for LE based on process algebra CSP (Communicating Sequential Process). Modeling algorithm like LE sometimes pose non-trivial challenges, time, geometry, communication delays and failures, mobility and bi-directionality can interact in unforeseen ways that are hard to model and analyze by automatic formal methods, but we will take on these challenges. On that basis, we use the model checker FDR (Failures Divergence Refinement) to automatically simulate the developed model and verify whether the model is consistent with the specification and exhibits relevant secure properties. Our results show the correctness and safety of LE in this respect.

show abstract

A PGAS-Based Implementation for the Parallel Minimum Spanning Tree Algorithm

Bejanyan

Astsatryan

2022

Large-Scale Scientific Computing

View full text Add to dashboard Cite

A Distributed Parallel Algorithm for the Minimum Spanning Tree Problem

Cited by 7 publications

References 14 publications

Study Morphology of Minimum Spanning Tree Problem and Generalized Algorithms

Study Morphology of Minimum Spanning Tree Problem and Generalized Algorithms

Modeling and Verifying Leader Election Algorithm in CSP (S)

A PGAS-Based Implementation for the Parallel Minimum Spanning Tree Algorithm

Contact Info

Product

Resources

About