Search Results for ""

The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

A sequence of moves (i.e., a path) on a chessboard by a chess piece in which each square of a chessboard is visited exactly once.

A plane parallel to two (or more) skew lines, also called a director plane. The orientation of a director is fixed, but it is specified uniquely only if a point lying on it ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

The eighth proposition in the third book of the Elements is one of Euclid's most complex propositions. It shows that a segment through an outside point D and a circle is ...

The angular distance traveled around a circle is the number of radians the path subtends, theta=l/(2pir)2pi=l/r.