3008 search results - page 202 / 602 » Independence in connected graphs |
222
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...
310
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
183
click to vote
DAM
2008
15 years 7 months ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
301
click to vote
IWPEC
2010
Springer
15 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
159
click to vote
IM
2007
15 years 7 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...