Results 1  10
of
893,058
Minimum spanning tree algorithm
, 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
"... We propose two Euclidean minimum spanning tree based clustering algorithms — one a kconstrained, and the other an unconstrained algorithm. Our kconstrained clustering algorithm produces a kpartition 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 kconstrained, and the other an unconstrained algorithm. Our kconstrained clustering algorithm produces a kpartition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set
Minimum spanning trees and clusters
, 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 on Polyhedra
, 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
, 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
"... In many real world problems related to weighted graphs, the input data corresponding to the weights are often imprecise due to incomplete or nonobtainable 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 nonobtainable information. Finding the minimum spanning tree of such type of connected graphs is a challenge. This paper is introduced to find minimum
Increasing the Weight of Minimum Spanning Trees
, 1996
"... The problems of computing the maximum increase in the weight of the minimum spanning trees of a graph caused by the removal of a given number of edges, or by finite increases in the weights of the edges, are investigated. For the case of edge removals, the problem is shown to be NPhard and an \Omeg ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
The problems of computing the maximum increase in the weight of the minimum spanning trees of a graph caused by the removal of a given number of edges, or by finite increases in the weights of the edges, are investigated. For the case of edge removals, the problem is shown to be NP
On Minimum Spanning Trees
, 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 edgeweighted 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 edgeweighted graph
On the euclidean minimum spanning tree problem
 Computing Letters
"... Given a weighted graph G(V,E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. Th ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Given a weighted graph G(V,E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes
Dynamic Capacitated Minimum Spanning Trees
 In Proc. 3rd Intl. Conf. on Networking (ICN
, 2004
"... Given a set of terminals, each associated with a positive number denoting the traffic to be routed to a central terminal (root), the Capacitated Minimum Spanning Tree (CMST) problem asks for a minimum spanning tree, spanning all terminals, such that the amount of traffic routed from a subtree, linke ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Given a set of terminals, each associated with a positive number denoting the traffic to be routed to a central terminal (root), the Capacitated Minimum Spanning Tree (CMST) problem asks for a minimum spanning tree, spanning all terminals, such that the amount of traffic routed from a subtree
Results 1  10
of
893,058