Search Results for ""

A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...

The Königsberg bridge problem asks if the seven bridges of the city of Königsberg (left figure; Kraitchik 1942), formerly in Germany but now known as Kaliningrad and part of ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

For every ergodic flow on a nonatomic probability space, there is a measurable set intersecting almost every orbit in a discrete set.

The BCH code is an error-correcting code that is a generalization of the Reed-Muller error-correcting code used by the Voyager 2 spacecraft.

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

A compactum (plural: compacta) is a compact metric space. An example of a compactum is any finite discrete metric space. Also, the space [0,1] union [2,3] is a compactum, ...