2137 search results - page 51 / 428 » Experiments on Graph Clustering Algorithms |
ADMA
2010
Springer
13 years 5 months ago
2010
Springer
Multi-Agent Clustering (MAC) requires a mechanism for identifying the most appropriate cluster configuration. This paper reports on experiments conducted with respect to a number o...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
BMCBI
2007
13 years 7 months ago
2007
Background: This paper presents a unified framework for finding differentially expressed genes (DEGs) from the microarray data. The proposed framework has three interrelated modul...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...