301 search results - page 21 / 61 » On Finding Dense Subgraphs |
IM
2008
14 years 9 months ago
2008
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...
ECCC
2006
14 years 9 months ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
80
Voted
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
COLT
2003
Springer
15 years 2 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...