Julia and Python complex system applications in ecology, epidemiology, sociology, economics & finance; network science models including Bianconi-Barabási, Barabási-Albert, Watts-Strogatz, Waxman Model ...

Given a connected, undirected graph G whose edges are labeled (or colored), the minimum labeling spanning tree (MLST) problem seeks a spanning tree on G with the minimum number of distinct labels (or ...

But how do you find such a minimum spanning tree? Prim and Kruskal to the rescue! These are two algorithms that solve the same problem, finding a minimum weight spanning tree in a connected graph.

Automated clustering can be an important means of identifying structure in data, but many of the more popular clustering algorithms do not perform well in the presence of background noise. The ...

M. Lee and V. W. S. Wong, “An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks,” IEEE, 2005. [ 5 ] J. N. Al-Karaki, and A. E. Kamal, “Routing techniques in ...

This paper presents a clustering algorithm for partitioning a minimum spanning tree with a constraint on minimum group size. The problem is motivated by microaggregation, a disclosure limitation ...