Sorry, we do not have enough data to show an influence graph for this author.
Kruskal's minimum spanning tree algorithm is a graph algorithm which constructs the tree with the minimum total edge length. The starting node of the tree generated by Kruskal's algorithm is not important. This is an advantage in diffusion tensor fiber analysis. In this study, a tractography approach, which does not depend on user selection, independent… (More)