Search Results for ""

A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...

An O(nlgn) sorting algorithm which is not quite as fast as quicksort. It is a "sort-in-place" algorithm and requires no auxiliary storage, which makes it particularly concise ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

Leakage, more explicitly called spectral leakage, is a smearing of power across a frequency spectrum that occurs when the signal being measured is not periodic in the sample ...

An ordering for the Cartesian product × of any two sets A and B with order relations <A and <B, respectively, such that if (a_1,b_1) and (a_2,b_2) both belong to A×B, then ...

If a group of men and women may date only if they have previously been introduced, then a complete set of dates is possible iff every subset of men has collectively been ...

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...