Search Results for ""

A block is a maximal connected subgraph of a given graph G that has no articulation vertex (West 2000, p. 155). If a block has more than two vertices, then it is biconnected. ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

Let A denote an R-algebra, so that A is a vector space over R and A×A->A (1) (x,y)|->x·y. (2) Now define Z={x in A:x·y=0 for some y in A!=0}, (3) where 0 in Z. An Associative ...

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...

Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...

The Diffie-Hellman protocol is a method for two computer users to generate a shared private key with which they can then exchange information across an insecure channel. Let ...

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...

_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...

A factor is a portion of a quantity, usually an integer or polynomial that, when multiplied by other factors, gives the entire quantity. The determination of factors is ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...