An algorithm for finding a solution to the stable marriage problem in polynomial time.

plural of Las Vegas algorithm

(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).

plural of Reingold-Tilford algorithm

(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.

(computing) A randomized algorithm that always gives a correct result rather than merely giving a probably correct result.

(mathematics) A general-purpose integer factorization algorithm, particularly effective at splitting composite numbers with small factors.

An extension to the Euclidean algorithm, which computes the coefficients of Bézout's identity in addition to the greatest common divisor of two integers.

(computer graphics) An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares.

(computer graphics) An algorithm used for line clipping. It divides a two-dimensional space into nine regions (or a three-dimensional space into 27 regions), and then efficiently determines the lines and portions of lines that are visible in the central region, or viewport.