616 search results - page 19 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
166
click to vote
COR
2008
15 years 3 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
145
Voted
INFOVIS
2003
IEEE
15 years 8 months ago
2003
IEEE
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
127
Voted
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
113
Voted
PATMOS
2004
Springer
15 years 9 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
139
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...