3008 search results - page 103 / 602 » Independence in connected graphs |
173
click to vote
IICS
2005
Springer
15 years 12 months ago
2005
Springer
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...
175
click to vote
DCOSS
2009
Springer
15 years 11 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
151
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
117
click to vote
DAM
2006
15 years 6 months ago
2006
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
166
click to vote
JMLR
2010
15 years 1 months ago
2010
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...