Search Results for ""

A graphoid consists of a set M of elements together with two collections C and D of nonempty subsets of M, called circuits and cocircuits respectively, such that 1. For any C ...

This problem is NP-complete (Garey and Johnson 1983).

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

An encoding which provides a bijection between the n^(n-2) labeled trees on n nodes and strings of n-2 integers chosen from an alphabet of the numbers 1 to n. A labeled tree ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

Some authors define a general Airy differential equation as y^('')+/-k^2xy=0. (1) This equation can be solved by series solution using the expansions y = ...

The area moment of inertia is a property of a two-dimensional plane shape which characterizes its deflection under loading. It is also known as the second moment of area or ...

The arf invariant is a link invariant that always has the value 0 or 1. A knot has Arf invariant 0 if the knot is "pass equivalent" to the unknot and 1 if it is pass ...

Given a triangle with polygon vertices A, B, and C and points along the sides D, E, and F, a necessary and sufficient condition for the cevians AD, BE, and CF to be ...

Let the circles c_2 and c_3^' used in the construction of the Brocard points which are tangent to A_2A_3 at A_2 and A_3, respectively, meet again at D_A. The points D_AD_BD_C ...