scholarly journals Improved Visualization of Frequent Itemset Relationships Using the Minimal Spanning Tree Algorithm

2019 ◽  
Vol 26 (2) ◽  
Keyword(s):  
Spanning Tree ◽  
Frequent Itemset ◽  
Minimal Spanning Tree ◽  
Tree Algorithm

scholarly journals A Minimal Spanning Tree algorithm for source detection in γ-ray images

2007 ◽  
Vol 383 (3) ◽  
pp. 1166-1174 ◽  
Author(s):  
Riccardo Campana ◽  
Enrico Massaro ◽  
Dario Gasparrini ◽  
Sara Cutini ◽  
Andrea Tramacere
Keyword(s):  
Spanning Tree ◽  
Minimal Spanning Tree ◽  
Source Detection ◽  
Tree Algorithm ◽  
Γ Ray

On a proposed divide-and-conquer minimal spanning tree algorithm

1988 ◽  
Vol 28 (4) ◽  
pp. 785-789
Author(s):  
Ivan Stojmenović ◽  
Michael A. Langston
Keyword(s):  
Spanning Tree ◽  
Divide And Conquer ◽  
Minimal Spanning Tree ◽  
Tree Algorithm

A Minimal Spanning Tree Algorithm Applied to Spatial Cluster Analysis

2001 ◽  
Vol 7 ◽  
pp. 162-165 ◽  
Author(s):  
Juliano Palmieri Lage ◽  
Renato Martins Assunção ◽  
Edna Afonso Reis
Keyword(s):  
Cluster Analysis ◽  
Spanning Tree ◽  
Spatial Cluster ◽  
Minimal Spanning Tree ◽  
Tree Algorithm ◽  
Spatial Cluster Analysis

A Piecewise Solution to the Reconfiguration Problem by a Minimal Spanning Tree Algorithm

2014 ◽  
Vol 15 (5) ◽  
pp. 419-427
Author(s):  
Juan M. Ramirez ◽  
Diana P. Montoya
Keyword(s):  
Graph Theory ◽  
Combinatorial Optimization ◽  
Radial Distribution ◽  
Spanning Tree ◽  
Distribution Systems ◽  
Optimization Problem ◽  
Combinatorial Optimization Problem ◽  
Minimal Spanning Tree ◽  
Power Losses ◽  
Tree Algorithm

Abstract This paper proposes a minimal spanning tree (MST) algorithm to solve the networks’ reconfiguration problem in radial distribution systems (RDS). The paper focuses on power losses’ reduction by selecting the best radial configuration. The reconfiguration problem is a non-differentiable and highly combinatorial optimization problem. The proposed methodology is a deterministic Kruskal’s algorithm based on graph theory, which is appropriate for this application generating only a feasible radial topology. The proposed MST algorithm has been tested on an actual RDS, which has been split into subsystems.

A fully distributed (minimal) spanning tree algorithm

1986 ◽  
Vol 23 (2) ◽  
pp. 55-62 ◽  
Author(s):  
Ivan Lavallee ◽  
Gérard Roucairol
Keyword(s):  
Spanning Tree ◽  
Minimal Spanning Tree ◽  
Tree Algorithm

An upper bound for the probability of a union

1976 ◽  
Vol 13 (03) ◽  
pp. 597-603 ◽  
Author(s):  
David Hunter
Keyword(s):  
Graph Theory ◽  
Upper Bound ◽  
Spanning Tree ◽  
Upper Bounds ◽  
Minimal Spanning Tree ◽  
Multivariate Normal ◽  
Tail Probabilities ◽  
Tree Algorithm ◽  
New Family ◽  
The Family

The problem of bounding P(∪ Ai ) given P(A i) and P(A i A j) for i ≠ j = 1, …, k goes back to Boole (1854) and Bonferroni (1936). In this paper a new family of upper bounds is derived using results in graph theory. This family contains the bound of Kounias (1968), and the smallest upper bound in the family for a given application is easily derivable via the minimal spanning tree algorithm of Kruskal (1956). The properties of the algorithm and of the multivariate normal and t distributions are shown to provide considerable simplifications when approximating tail probabilities of maxima from these distributions.

Sign in / Sign up

Export Citation Format

Share Document