• ape

  • Referenced in 62 articles [sw04569]
  • reading, writing, plotting, and manipulating phylogenetic trees, analyses of comparative data in a phylogenetic framework ... tools such as Mantel’s test, minimum spanning tree, generalized skyline plots, graphical exploration...
  • spdep

  • Referenced in 38 articles [sw04578]
  • data analysis, including regional aggregation by minimum spanning tree; a collection of tests for spatial...
  • GeoSteiner

  • Referenced in 23 articles [sw04320]
  • currently the fastest program to calculate Steiner trees. It has been used to solve problems ... branch-and-cut code for finding minimum spanning trees in arbitrary hyper graphs, which ... Steiner Tree Problem in the Plane, Minimum Spanning Tree Problem in Hyper graphs The code...
  • STXXL

  • Referenced in 18 articles [sw06824]
  • external memory algorithms for computing minimum spanning trees, connected components, breadth-first search decompositions, constructing...
  • AS 13

  • Referenced in 2 articles [sw03909]
  • Algorithm AS 13. Minimum spanning tree...
  • AS 40

  • Referenced in 2 articles [sw03907]
  • Algorithm AS 40. Updating a minimum spanning tree...
  • mst_clustering

  • Referenced in 1 article [sw29188]
  • clustering: Clustering via Euclidean Minimum Spanning Trees. Scikit-learn style estimator for Minimum Spanning Tree ... here, based on a trimmed Euclidean Minimum Spanning Tree, can be useful in this case...
  • CNOP

  • Referenced in 7 articles [sw00139]
  • route planning, curve approximation, minimum cost reliability constrained spanning trees and the table layout problem...
  • MiSTree

  • Referenced in 1 article [sw30562]
  • Python package for constructing and analysing Minimum Spanning Trees. The minimum spanning tree...
  • RNACluster

  • Referenced in 2 articles [sw23124]
  • base pair distance, mountain distance, morphological distance, tree edit distance, string edit distance ... ensemble clustering using a minimum spanning tree (MST) based algorithm. RNACluster can be used...
  • CciMST

  • Referenced in 1 article [sw31403]
  • CciMST: a clustering algorithm based on minimum spanning tree and cluster centers. The minimum spanning...
  • mcMST

  • Referenced in 1 article [sw29266]
  • Toolbox for the Multi-Criteria Minimum Spanning Tree Problem. Algorithms to approximate the Pareto-front ... multi-criteria minimum spanning tree problems. Additionally, a modular toolbox for the generation of multi...
  • AS 14

  • Referenced in 1 article [sw03910]
  • Algorithm AS 14. Printing the minimum spanning tree...
  • AdTree

  • Referenced in 1 article [sw39843]
  • input point cloud by establishing a minimum spanning tree using the Dijkstra shortest-path algorithm...
  • restlos

  • Referenced in 1 article [sw32642]
  • mode) and scatter based on minimum spanning trees (pMST), self-organizing maps (Flood Algorithm), Delaunay...
  • pyvine

  • Referenced in 1 article [sw38439]
  • vine structure which maximizes the vine tree dependence, i.e., the sum of the absolute values ... edges using PRIM algorithm of minimum-spanning-tree in a sequential way. The maximum likelihood...
  • PHYLOViZ

  • Referenced in 1 article [sw34188]
  • associated epidemiological data. goeBURST and its Minimum Spanning Tree expansion are used for visualizing...
  • Peklo

  • Referenced in 0 articles [sw05763]
  • balanced flows), minimum cuts, shortest path, minimum spanning tree, and maximum matching...
  • CampaR1

  • Referenced in 0 articles [sw18436]
  • trajectory based on the minimum spanning tree constructed on the distances between snapshots. The fast...
  • gSkeletonClu

  • Referenced in 3 articles [sw30861]
  • Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration. Community detection ... However, it depends on a sensitive parameter: minimum similarity threshold ε, but provides no automated ... network to its Core-Connected Maximal Spanning Tree (CCMST), the network clustering problem is converted...