Search Results for ""

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

The approximation problem is a well known problem of functional analysis (Grothendieck 1955). It asks to determine whether every compact operator T from a Banach space X to a ...

A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating ...

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...

The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...

A canonical labeling, also called a canonical form, of a graph G is a graph G^' which is isomorphic to G and which represents the whole isomorphism class of G (Piperno 2011). ...

One of the quantities lambda_i appearing in the Gauss-Jacobi mechanical quadrature. They satisfy lambda_1+lambda_2+...+lambda_n = int_a^bdalpha(x) (1) = alpha(b)-alpha(a) (2) ...

A tool with two arms joined at their ends which can be used to draw circles. In geometric constructions, the classical Greek rules stipulate that the compass cannot be used ...

The cyclocevian triangle DeltaA^('')B^('')C^('') of a reference triangle DeltaABC with respect to a point P is the triangle formed by the vertices determined by the ...

Consider two cylinders as illustrated above (Hubbell 1965) where the cylinders have radii r_1 and r_2 with r_1<=r_2, the larger cylinder is oriented along the z-axis, and ...