499 search results - page 72 / 100 » A Search Algorithm for Clusters in a Network or Graph |
WWW
2010
ACM
14 years 2 months ago
2010
ACM
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
STOC
2010
ACM
13 years 12 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
BMCBI
2004
13 years 7 months ago
2004
Background: Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and soci...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...