2137 search results - page 47 / 428 » Experiments on Graph Clustering Algorithms |
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
CCGRID
2009
IEEE
14 years 21 days ago
2009
IEEE
Replication in grid file systems can significantly improves I/O performance of data-intensive applications. However, most of existing replication techniques apply to individual ...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
ACID
2006
13 years 9 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...