439 search results - page 16 / 88 » Engineering Comparators for Graph Clusterings |
CIVR
2008
Springer
13 years 9 months ago
2008
Springer
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
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...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
CMOT
2004
13 years 7 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...