Search Results for ""

A linear code over a finite field with q elements F_q is a linear subspace C subset F_q^n. The vectors forming the subspace are called codewords. When codewords are chosen ...

The distance from the center of a circle to its perimeter, or from the center of a sphere to its surface. The radius is equal to half the diameter.

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

A pseudocylindrical map projection which distorts shape, area, scale, and distance to create attractive average projection properties.

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

An equation representing a locus L in the n-dimensional Euclidean space. It has the form L:f(x_1,...,x_n)=0, (1) where the left-hand side is some expression of the Cartesian ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...