Results 1 - 10 of 9,216

Minimum spanning tree algorithm

by Vikas C.S , 2010
"... An algorithm for minimum spanning tree [1] is discussed here. Apart from the traditional Kruskal‟s [2] and Prim‟s [3] algorithm for finding the minimum spanning tree, yet another algorithm for the same purpose is described here. Initially we form a forest and then we convert the forest into the mini ..."
Abstract - Add to MetaCart
An algorithm for minimum spanning tree [1] is discussed here. Apart from the traditional Kruskal‟s [2] and Prim‟s [3] algorithm for finding the minimum spanning tree, yet another algorithm for the same purpose is described here. Initially we form a forest and then we convert the forest

Clustering with Minimum Spanning Trees

by Yan Zhou , Oleksandr Grygorash , Thomas F. Hain , Meador Inge , Zach Jorgensen
"... We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set of r ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set

Minimum spanning trees and clusters

by Thomas Lumley , 2009
"... The Euclidean minimum spanning tree for a set of points is the shortest tree connecting all the points. It can be used for clustering, by dropping the longest edges. There are three related greedy algorithms for the minimum spanning tree, all of which come very close to the lower bound for asymptoti ..."
Abstract - Add to MetaCart
The Euclidean minimum spanning tree for a set of points is the shortest tree connecting all the points. It can be used for clustering, by dropping the longest edges. There are three related greedy algorithms for the minimum spanning tree, all of which come very close to the lower bound

Minimum Spanning Trees

by Bang Ye Wu, et al. - SPANNING TREES AND OPTIMIZATION PROBLEMS (EXCERPT)
"... What is a minimum spanning tree for the weighted graph in Figure 2.1? Notice that a minimum spanning tree is not necessarily unique. FIGURE 2.1: A weighted graph. Figure 2.2 gives four minimum spanning trees, where each of them is of total weight 14. Let G + e denote the graph obtained by inserting ..."
Abstract - Add to MetaCart
What is a minimum spanning tree for the weighted graph in Figure 2.1? Notice that a minimum spanning tree is not necessarily unique. FIGURE 2.1: A weighted graph. Figure 2.2 gives four minimum spanning trees, where each of them is of total weight 14. Let G + e denote the graph obtained by inserting

Minimum spanning trees

by Pallavi Jayawant, Kerry Glavin - INVOLVE 2:4(2009) , 2009
"... The minimum spanning tree problem originated in the 1920s when O. Borůvka identified and solved the problem during the electrification of Moravia. This graph theory problem and its numerous applications have inspired many others to look for alternate ways of finding a spanning tree of minimum weigh ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
The minimum spanning tree problem originated in the 1920s when O. Borůvka identified and solved the problem during the electrification of Moravia. This graph theory problem and its numerous applications have inspired many others to look for alternate ways of finding a spanning tree of minimum

Minimum Spanning Trees on Polyhedra

by Michael J. Spriggs, J. Mark Keil , 1999
"... In this paper, we consider the problem of generating a minimum spanning tree (MST) of a set of sites lying on the surface of an open polyhedron. The distance between any two sites is the length of a shortest path between them that is constrained to lie strictly upon the polyhedral surface. We presen ..."
Abstract - Add to MetaCart
In this paper, we consider the problem of generating a minimum spanning tree (MST) of a set of sites lying on the surface of an open polyhedron. The distance between any two sites is the length of a shortest path between them that is constrained to lie strictly upon the polyhedral surface. We

External memory minimum spanning trees

by Dominik Schultes , 2003
"... While in the last years much theoretical work about external memory minimum spanning trees was done, the practical realization of the designed algorithms was neglected. It is the goal of my Bachelor thesis to fill this gap, i.e., we will show that the computation of minimum spanning trees of very la ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
While in the last years much theoretical work about external memory minimum spanning trees was done, the practical realization of the designed algorithms was neglected. It is the goal of my Bachelor thesis to fill this gap, i.e., we will show that the computation of minimum spanning trees of very

Minimum Spanning Tree with Rough Weights

by Sagarika Biswal, S. P. Mohanty
"... In many real world problems related to weighted graphs, the input data corresponding to the weights are often imprecise due to incomplete or non-obtainable information. Finding the minimum spanning tree of such type of connected graphs is a challenge. This paper is introduced to find minimum spannin ..."
Abstract - Add to MetaCart
In many real world problems related to weighted graphs, the input data corresponding to the weights are often imprecise due to incomplete or non-obtainable information. Finding the minimum spanning tree of such type of connected graphs is a challenge. This paper is introduced to find minimum

On Minimum Spanning Trees

by D. Pe'er, A. Wigderson , 1998
"... The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical computer science. Its history dates back to Boruvka's algorithm in 1926 and till today it is a extensively researched problem with new breakthroughs only recently. Given an edge-weighted graph, t ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical computer science. Its history dates back to Boruvka's algorithm in 1926 and till today it is a extensively researched problem with new breakthroughs only recently. Given an edge-weighted graph

An optimal minimum spanning tree algorithm

by Seth Pettie, Vijaya Ramachandran - J. ACM , 2000
"... Abstract. We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to find a minimum spanning tree of a graph with n vertices and m edges that runs in time O(T ∗ (m, n)) where T ∗ is ..."
Abstract - Cited by 58 (11 self) - Add to MetaCart
Abstract. We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to find a minimum spanning tree of a graph with n vertices and m edges that runs in time O(T ∗ (m, n)) where
Results 1 - 10 of 9,216