114 search results - page 18 / 23 » An efficient condition for a graph to be Hamiltonian |
DAM
2002
13 years 8 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
RECOMB
2003
Springer
14 years 8 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
CCS
2007
ACM
14 years 2 months ago
2007
ACM
The paper describes a Non-Intrusive IP traceback scheme which uses sampled traffic under non-attack conditions to build and maintains caches of the valid source addresses transiti...