4009 search results - page 55 / 802 » Clustering on Complex Graphs |
ASUNAM
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
101
click to vote
IWPC
2000
IEEE
15 years 4 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
105
click to vote
ICONIP
2008
15 years 1 months ago
2008
Abstract. Internet literature queries return a long lists of citations, ordered according to their relevance or date. Query results may also be represented using Visual Language th...
RSA
2011
14 years 6 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
DNA
2006
Springer
15 years 3 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...