scholarly journals Meminimalisir Biaya Pembuatan Saluran Air PDAM Di Wilayah KLU Menggunakan Algoritma Kruskal

2019 ◽  
Vol 1 (1) ◽  
pp. 27
Author(s):  
Devi Lastri ◽  
Masriani ◽  
Nadia W ◽  
Parizal Hidayatullah ◽  
Wahyu Ulfayandhie Misuki ◽  
...  
Keyword(s):  
Spanning Tree ◽  
Water Distribution ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Clean Water ◽  
Minimum Spanning Trees ◽  
Tree Algorithm ◽  
Shortest Route ◽  
Minimize Costs

The kruskal algorithm is an algorithm to search for minimum spanning trees directly based on the general MST (Minimum Spanning Tree) algorithm. In the kruskal algorithm, the sides in the graph are sorted first based on their weight from small to large. The kruskal algorithm in the search for a minimum spanning tree can be applied to the distribution of clean water of PDAM in North Lombok district. This problem is intended to get the shortest route for PDAM water distribution in North Lombok district in order to minimize costs.

scholarly journals A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks

2016 ◽  
Vol 62 (4) ◽  
pp. 379-388 ◽  
Author(s):  
Iwona Dolińska ◽  
Mariusz Jakubowski ◽  
Antoni Masiukiewicz ◽  
Grzegorz Rządkowski ◽  
Kamil Piórczyński
Keyword(s):  
Greedy Algorithm ◽  
Channel Assignment ◽  
Spanning Tree ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Minimum Spanning Trees ◽  
Undirected Graphs ◽  
Interference Level ◽  
802.11 Networks ◽  
Crowded Environment

Abstract Channel assignment in 2.4 GHz band of 802.11 standard is still important issue as a lot of 2.4 GHz devices are in use. This band offers only three non-overlapping channels, so in crowded environment users can suffer from high interference level. In this paper, a greedy algorithm inspired by the Prim’s algorithm for finding minimum spanning trees (MSTs) in undirected graphs is considered for channel assignment in this type of networks. The proposed solution tested for example network distributions achieves results close to the exhaustive approach and is, in many cases, several orders of magnitude faster.

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.

EVOLUTIONARY TOPOLOGY OF A CURRENCY NETWORK IN ASIA

2010 ◽  
Vol 21 (04) ◽  
pp. 471-480 ◽  
Author(s):  
XIAOBING FENG ◽  
XIAOFAN WANG
Keyword(s):  
Exchange Rate ◽  
Spanning Tree ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Structural Evolution ◽  
Growth Cycle ◽  
Minimum Spanning Trees ◽  
Trade Volume ◽  
National Wealth ◽  
Us Dollar

Although recently there are extensive research on currency network using minimum spanning trees approach, the knowledge about the actual evolution of a currency web in Asia is still limited. In the paper, we study the structural evolution of an Asian network using daily exchange rate data. It was found that the correlation between Asian currencies and US Dollar, the previous regional key currency has become weaker and the intra-Asia interactions have increased. This becomes more salient after the exchange rate reform of China. Different from the previous studies, we further reveal that it is the trade volume, national wealth gap and countries growth cycle that has contributed to the evolutionary topology of the minimum spanning tree. These findings provide a valuable platform for theoretical modeling and further analysis.

scholarly journals Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees

2015 ◽  
Vol 2015 (2) ◽  
pp. 188-205 ◽  
Author(s):  
Peeter Laud
Keyword(s):  
Large Class ◽  
Spanning Tree ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Black Box ◽  
Secure Multiparty Computation ◽  
Multiparty Computation ◽  
Minimum Spanning Trees ◽  
Asymptotic Performance ◽  
Underlying Graph

AbstractIn this paper, we describe efficient protocols to perform in parallel many reads and writes in private arrays according to private indices. The protocol is implemented on top of the Arithmetic Black Box (ABB) and can be freely composed to build larger privacypreserving applications. For a large class of secure multiparty computation (SMC) protocols, our technique has better practical and asymptotic performance than any previous ORAM technique that has been adapted for use in SMC.Our ORAM technique opens up a large class of parallel algorithms for adoption to run on SMC platforms. In this paper, we demonstrate how the minimum spanning tree (MST) finding algorithm by Awerbuch and Shiloach can be executed without revealing any details about the underlying graph (beside its size). The data accesses of this algorithm heavily depend on the location and weight of edges (which are private) and our ORAM technique is instrumental in their execution. Our implementation is the first-ever realization of a privacypreserving MST algorithm with sublinear round complexity.

scholarly journals A Note on Ultrametric Spaces, Minimum Spanning Trees and the Topological Distance Algorithm

Information ◽  
2020 ◽  
Vol 11 (9) ◽  
pp. 418
Author(s):  
Jörg Schäfer
Keyword(s):  
Spanning Tree ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Greedy Algorithms ◽  
Reconstruction Algorithm ◽  
Minimum Spanning Trees ◽  
Ultrametric Spaces ◽  
Correctness Proof ◽  
Topological Distance ◽  
Join Algorithm

We relate the definition of an ultrametric space to the topological distance algorithm—an algorithm defined in the context of peer-to-peer network applications. Although (greedy) algorithms for constructing minimum spanning trees such as Prim’s or Kruskal’s algorithm have been known for a long time, they require the complete graph to be specified and the weights of all edges to be known upfront in order to construct a minimum spanning tree. However, if the weights of the underlying graph stem from an ultrametric, the minimum spanning tree can be constructed incrementally and it is not necessary to know the full graph in advance. This is possible, because the join algorithm responsible for joining new nodes on behalf of the topological distance algorithm is independent of the order in which the nodes are added due to the property of an ultrametric. Apart from the mathematical elegance which some readers might find interesting in itself, this provides not only proofs (and clearer ones in the opinion of the author) for optimality theorems (i.e., proof of the minimum spanning tree construction) but a simple proof for the optimality of the reconstruction algorithm omitted in previous publications too. Furthermore, we define a new algorithm by extending the join algorithm to minimize the topological distance and (network) latency together and provide a correctness proof.

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

2010 ◽  
Vol 1 (4) ◽  
pp. 16-30
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.

scholarly journals Investigating the Disparities of China’s Insurance Market Based on Minimum Spanning Tree from the Viewpoint of Geography and Enterprise

2017 ◽  
Vol 5 (3) ◽  
pp. 216-228
Author(s):  
Chi Xie ◽  
Yingying Zhou ◽  
Gangjin Wang ◽  
Xinguo Yan
Keyword(s):  
Spanning Tree ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Insurance Market ◽  
Minimum Spanning Trees ◽  
Monthly Data ◽  
Property Insurance ◽  
Personal Insurance

Abstract In this paper, we investigate the disparities of China’s insurance market from the viewpoint of geography and enterprise by using the monthly data from January 2006 to December 2015. We divide the whole insurance market into two parts, namely property insurance and personal insurance. By constructing and analyzing minimum spanning trees of insurance market, we obtain the results as follows: (i) The connections between provinces are much closer than those of firms, and there are regional links between neighboring provinces in the minimum spanning tree (MST); and (ii) the domestic funded firms and foreign funded firms form two explicit clusters in the MSTs of property and personal insurance market.

AN EREW PARM ALGORITHM FOR UPDATING MINIMUM SPANNING TREES

1999 ◽  
Vol 09 (01) ◽  
pp. 111-122 ◽  
Author(s):  
SAJAL K. DAS ◽  
PAOLO FERRAGINA
Keyword(s):  
Data Structure ◽  
Spanning Tree ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Undirected Graph ◽  
Substantial Improvement ◽  
Minimum Spanning Trees ◽  
Single Edge ◽  
Sequential Approach ◽  
Work Complexity

We propose a parallel algorithm for the EREW PRAW model that maintains a minimum spanning tree (MST) of an undirected graph under single edge insertions and deletions. For a graph of n nodes and m edges, each update requires O( log n) time and O(m 2/3 log n) work. This is a substantial improvement over the known bounds on the work complexity. Our algorithm uses a partition of the MST, similar to the sequential approach due to Frederickson [6], and also employs a novel data structure for efficiently managing edge insertions in parallel.

Sign in / Sign up

Export Citation Format

Share Document