Search Results for ""

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...

Four bits or half a byte, also sometimes spelled "nybble." Since a nibble encodes values from 0 to 2^4-1=15, it can conveniently be represented using a single hexadecimal ...

Given a convex plane region with area A and perimeter p, A-1/2p<N<=A+1/2p+1, where N is the number of enclosed lattice points (Nosarzewska 1948). This improves on Jarnick's ...

Place 2n balls in a bag and number them 1 to 2n, then pick half of them at random. The number of different possible sums for n=1, 2, 3, ... are then 2, 5, 10, 17, 26, ... ...

Numerical stability refers to how a malformed input affects the execution of an algorithm. In a numerically stable algorithm, errors in the input lessen in significance as ...

An octomino is an 8-polyomino. There are 369 free (illustrated above), 704 one-sided, and 2725 fixed octominoes.

An odd chordless cycle is a chordless cycle of length >4. A graph is said to be perfect iff neither the graph G nor its graph complement G^_ has an odd chordless cycle. A ...

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...

A tree is planted at each lattice point in a circular orchard which has center at the origin and radius r. If the radius of trees exceeds 1/r units, one is unable to see out ...