Fast Determination of Minimum Spanning Tree Based on Down-sizing Technique of Edges Population

2014 ◽  
Vol 14 (1) ◽  
pp. 51-59 ◽  
Author(s):  
Sang-Un Lee ◽  
Myeong-Bok Choi
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Fast Determination

scholarly journals Massive cold cloud clusters

2015 ◽  
Vol 12 (S316) ◽  
pp. 133-134 ◽  
Author(s):  
L. Viktor Toth ◽  
Sarolta Zahorecz ◽  
Gabor Marton ◽  
Isabelle Ristorcelli ◽  
Mika Juvela ◽  
...  
Keyword(s):  
Star Formation ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Small Scale ◽  
3D Space ◽  
Cloud Clusters ◽  
Luminous Objects ◽  
Early Phases ◽  
Almost Unbiased

AbstractThe all-sky Planck catalogue of Galactic Cold Clumps (PGCC) allows an almost unbiased study of the early phases of star-formation in our Galaxy. Several thousand of the clumps have also distance estimates allowing a determination of mass and density. The nature of Planck cold clumps varies from IRDCs to tiny nearby cold clouds with masses ranging from one to several tens of thousands solar masses. Some of the clumps are embedded in GMCs, others are isolated. Some are close or even very close to OB associations, while others lay far from any UV luminous objects. The small scale clustering of nearby PGCCs was studied with the improved Minimum Spanning Tree (MST) method identifying groups in 3D space, locating also massive cold cloud clusters eg. PGCCMST G210.6-19.5 in LDN 1641.

scholarly journals Consistent and powerful non-Euclidean graph-based change-point test with applications to segmenting random interfered video data

2018 ◽  
Vol 115 (23) ◽  
pp. 5914-5919 ◽  
Author(s):  
Xiaoping Shi ◽  
Yuehua Wu ◽  
Calyampudi Radhakrishna Rao
Keyword(s):  
Change Point ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Hamiltonian Path ◽  
Video Data ◽  
Change Point Detection ◽  
Change Point Test ◽  
Point Test ◽  
Point Detection

The change-point detection has been carried out in terms of the Euclidean minimum spanning tree (MST) and shortest Hamiltonian path (SHP), with successful applications in the determination of authorship of a classic novel, the detection of change in a network over time, the detection of cell divisions, etc. However, these Euclidean graph-based tests may fail if a dataset contains random interferences. To solve this problem, we present a powerful non-Euclidean SHP-based test, which is consistent and distribution-free. The simulation shows that the test is more powerful than both Euclidean MST- and SHP-based tests and the non-Euclidean MST-based test. Its applicability in detecting both landing and departure times in video data of bees’ flower visits is illustrated.

Implementasi Algoritma Prim Dalam Penentuan Ikatan Senyawa Kimia

2018 ◽  
Vol 9 (2) ◽  
pp. 48-51
Author(s):  
Olivia Benazir Ester Tiwow ◽  
Adhi Kusnadi
Keyword(s):  
Programming Language ◽  
Chemical Compound ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Chemical Compounds ◽  
Accuracy Rate ◽  
Class A ◽  
Minimum Number ◽  
Index Terms

This research concerns the implementation of Prim algorithm in the determination of bond of a chemical compound. By doing a minimum spanning tree search of a weight graph that has been created. Input from the user in the form of chemical compounds will be processed so that the compound can be divided into elements that will act as nodes on the prime algorithm. Weight of the tangent node is obtained from the comparison of the minimum number of atoms that can react between the two elements that will be bonded to each other. Applications developed on the basis of the web by considering the functionality of the design can be accessed by many people. System design is poured into HTML and Javascript programming language. All design functionality is poured into the Javascript programming language. This study is still limited to programs that can only process the input of compounds that are in class A in the periodic table. And preformed compounds such as SO42-, HO3-. This application has an accuracy rate of 77.41% and 66.67% of testers said that this application is useful for Indonesian education. Index Terms—Chemical Compound, prim algoritm, minimum spanning tree, website, Javascript.

scholarly journals Efficient determination of the k most vital edges for the minimum spanning tree problem

2012 ◽  
Vol 39 (11) ◽  
pp. 2888-2898 ◽  
Author(s):  
Cristina Bazgan ◽  
Sonia Toubaline ◽  
Daniel Vanderpooten
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Minimum Spanning Tree Problem
Sign in / Sign up

Export Citation Format

Share Document