Search Results for ""

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...

(1) for p in [0,1], where delta is the central difference and E_(2n) = G_(2n)-G_(2n+1) (2) = B_(2n)-B_(2n+1) (3) F_(2n) = G_(2n+1) (4) = B_(2n)+B_(2n+1), (5) where G_k are ...

Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

A stochastic approximation method that functions by placing conditions on iterative step sizes and whose convergence is guaranteed under mild conditions. However, the method ...

If f(x) is positive and decreases to 0, then an Euler constant gamma_f=lim_(n->infty)[sum_(k=1)^nf(k)-int_1^nf(x)dx] can be defined. For example, if f(x)=1/x, then ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...