Search Results for ""

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

A pair of positive integers (a_1,a_2) such that the equations a_1+a_2x=sigma(a_1)=sigma(a_2)(x+1) (1) have a positive integer solution x, where sigma(n) is the divisor ...

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

One name for the figure used by Euclid to prove the Pythagorean theorem. It is sometimes also known as the "windmill."

If the total group of the canonical series is divided into two parts, the difference between the number of points in each part and the double of the dimension of the complete ...

For a curve with first fundamental form ds^2=Edu^2+2Fdudv+Gdv^2, (1) the Gaussian curvature is K=(M_1-M_2)/((EG-F^2)^2), (2) where M_1 = |-1/2E_(vv)+F_(uv)-1/2G_(uu) 1/2E_u ...

Brocard geometry is that part of triangle geometry concerned with the Brocard points, Brocard triangles, etc.

Brocard's conjecture states that pi(p_(n+1)^2)-pi(p_n^2)>=4 for n>=2, where pi(n) is the prime counting function and p_n is the nth prime. For n=1, 2, ..., the first few ...

The inverse of the Laplace transform, given by F(t)=1/(2pii)int_(gamma-iinfty)^(gamma+iinfty)e^(st)f(s)ds, where gamma is a vertical contour in the complex plane chosen so ...

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