Search Results for ""

The adjacency list representation of a graph consists of n lists one for each vertex v_i, 1<=i<=n, which gives the vertices to which v_i is adjacent. The adjacency lists of a ...

Given a power spectrum (a plot of power vs. frequency), aliasing is a false translation of power falling in some frequency range (-f_c,f_c) outside the range. Aliasing is ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating ...

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...