394 search results - page 52 / 79 » Testing subgraphs in large graphs |
WAW
2004
Springer
14 years 1 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
HICSS
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper discusses the design and implementation of a Service Generator Toolkit (SGT) that allows web services researchers to easily create large numbers of web services. When d...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
CMSB
2006
Springer
13 years 11 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...