159 citations · 313 across the 22 of their papers we have counts for
Showing 2010 · cs.DSShow all
2 papers · 2 filters
cs.DS2010★ 159 cited
Analysis of Agglomerative Clustering
Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze +1
The diameter -clustering problem is the problem of partitioning a finite subset of into subsets called clusters such that the maximum diameter of the clusters…
cs.DS2010★ 1 cited
Finding Cycles and Trees in Sublinear Time
Artur Czumaj, Oded Goldreich, Dana Ron +3
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least and tree-minors in bounded-degree graphs. The complexity of these algorithm…