616 search results - page 47 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
119
click to vote
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
178
click to vote
TMC
2012
13 years 3 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
105
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
105
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library ST...