616 search results - page 2 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
HPCC
2007
Springer
13 years 10 months ago
2007
Springer
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
AINA
2009
IEEE
13 years 11 months ago
2009
IEEE
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
INFOCOM
1992
IEEE
13 years 8 months ago
1992
IEEE
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...