Relation-algebraic derivation of spanning tree algorithms

1998 ◽  
pp. 23-43 ◽  
Author(s):  
Rudolf Berghammer ◽  
Burghard von Karger ◽  
Andreas Wolf
Keyword(s):  
Spanning Tree ◽  
Tree Algorithms

scholarly journals Preconditioning methods based on spanning tree algorithms

2021 ◽  
Vol 1715 ◽  
pp. 012005
Author(s):  
D V Perevozkin ◽  
G A Omarova
Keyword(s):  
Spanning Tree ◽  
Tree Algorithms

On the Euclidean Minimum Spanning Tree Problem

2005 ◽  
Vol 1 (1) ◽  
pp. 11-14 ◽  
Author(s):  
Sanguthevar Rajasekaran
Keyword(s):  
Spanning Tree ◽  
Euclidean Distance ◽  
Minimum Spanning Tree ◽  
Linear Time ◽  
Randomized Algorithm ◽  
Weighted Graph ◽  
Deterministic Algorithm ◽  
Probabilistic Algorithms ◽  
Tree Algorithms ◽  
Minimum Spanning Tree Problem

Given a weighted graph G(V;E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. The weight on any edge is the Euclidean distance between the two points. Finding a minimum spanning tree for this graph is known as the Euclidean minimum spanning tree problem (EMSTP). The minimum spanning tree algorithms alluded to before will run in time O(n2) (or nearly O(n2)) on this graph. In this note we point out that it is possible to devise simple algorithms for EMSTP in k- dimensions (for any constant k) whose expected run time is O(n), under the assumption that the points are uniformly distributed in the space of interest.CR Categories: F2.2 Nonnumerical Algorithms and Problems; G.3 Probabilistic Algorithms

scholarly journals Randomized minimum spanning tree algorithms using exponentially fewer random bits

2008 ◽  
Vol 4 (1) ◽  
pp. 1-27 ◽  
Author(s):  
Seth Pettie ◽  
Vijaya Ramachandran
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Tree Algorithms

Computational Methods for Minimum Spanning Tree Algorithms

1984 ◽  
Vol 5 (1) ◽  
pp. 157-174 ◽  
Author(s):  
R. E. Haymond ◽  
J. P. Jarvis ◽  
D. R. Shier
Keyword(s):  
Computational Methods ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Tree Algorithms

Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm

2012 ◽  
pp. 256-270
Author(s):  
Wen-Chih Chang ◽  
Te-Hua Wang ◽  
Yan-Da Chiu
Keyword(s):  
Data Structure ◽  
Spanning Tree ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Experimental Results ◽  
Dijkstra’S Algorithm ◽  
Board Game ◽  
Tree Algorithm ◽  
Dijkstra's Algorithm ◽  
Tree Algorithms

The concept of minimum spanning tree algorithms in data structure is difficult for students to learn and to imagine without practice. Usually, learners need to diagram the spanning trees with pen to realize how the minimum spanning tree algorithm works. In this paper, the authors introduce a competitive board game to motivate students to learn the concept of minimum spanning tree algorithms. They discuss the reasons why it is beneficial to combine graph theories and board game for the Dijkstra and Prim minimum spanning tree theories. In the experimental results, this paper demonstrates the board game and examines the learning feedback for the mentioned two graph theories. Advantages summarizing the benefits of combining the graph theories with board game are discussed.

Active Node Detection in A Reconfigurable Microgrid using Minimum Spanning Tree Algorithms

2017 ◽  
Vol 5 (3) ◽  
pp. 502 ◽  
Author(s):  
Anay Majee ◽  
Souradeep Nanda ◽  
Gnana Swathika O.V
Keyword(s):  
Renewable Energy ◽  
Spanning Tree ◽  
Power Flow ◽  
Minimum Spanning Tree ◽  
Grid Connection ◽  
Protection Strategies ◽  
Sample Test ◽  
Minimum Number ◽  
Tree Algorithms ◽  
Bus Networks

<p>Microgrids are the solution to the growing demand for energy in the recent times. It has the potential to improve local reliability, reduce cost and increase penetration rates for distributed renewable energy generation. Inclusion of Renewable Energy Systems (RES) which have become the topic of discussion in the recent times due to acute energy crisis, causes the power flow in the microgrid to be bi-directional in nature. The presence of the RES in the microgrid system causes the grid to be reconfigurable. This reconfiguration might also occur due to load or utility grid connection and disconnection. Thus conventional protection strategies are not applicable to micro-grids and is hence challenging for engineers to protect the grid in a fault condition. In this paper various Minimum Spanning Tree (MST) algorithms are applied in microgrids to identify the active nodes of the current topology of the network in a heuristic approach and thereby generating a tree from the given network so that minimum number of nodes have to be disconnected from the network during fault clearance. In the paper we have chosen the IEEE-39 and IEEE-69 bus networks as our sample test systems.</p>

Sign in / Sign up

Export Citation Format

Share Document