Search Results for ""

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...

For every positive integer n, there exists a sphere which has exactly n lattice points on its surface. The sphere is given by the equation ...

The Kuratowski reduction theorem states that very nonplanar graph contains either the utility graph UG=K_(3,3) or the pentatope graph K_5 as a graph minor. The graphs K_(3,3) ...

An attractive tiling of the square composed of two types of triangular tiles. It consists of 16 equilateral triangles and 32 15 degrees-15 degrees-150 degrees isosceles ...

A procedure for decomposing an N×N matrix A into a product of a lower triangular matrix L and an upper triangular matrix U, LU=A. (1) LU decomposition is implemented in the ...

Let P(N) denote the number of primes of the form n^2+1 for 1<=n<=N, then P(N)∼0.68641li(N), (1) where li(N) is the logarithmic integral (Shanks 1960, pp. 321-332). Let Q(N) ...

A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...

The Lambert azimuthal equal-area projection is a map projection having transformation equations x = k^'cosphisin(lambda-lambda_0) (1) y = ...

Let lambda be the longitude, lambda_0 the reference longitude, phi the latitude, phi_0 the reference latitude, and phi_1 and phi_2 the standard parallels. Then the ...