214 search results - page 21 / 43 » The node capacitated graph partitioning problem: A computati... |
121
Voted
FSTTCS
2009
Springer
15 years 5 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
119
click to vote
SIROCCO
2008
15 years 2 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
121
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
101
Voted
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
105
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...