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 ...

An ambient isotopy from an embedding of a manifold M in N to another is a homotopy of self diffeomorphisms (or isomorphisms, or piecewise-linear transformations, etc.) of N, ...

The "echidnahedron" is the term for the spiky fourth icosahedron stellation (in the enumeration of Maeder 1994) apparently first used in the Netlib polyhedron database. It is ...

The metabiaugmented dodecahedron is a convex equilateral solid that is Johnson solid J_(60). The unit metabiaugmented dodecahedron has volume V=1/6(25+11sqrt(5)) (1) and Dehn ...

The parabiaugmented dodecahedron is a convex equilateral solid that is Johnson solid J_(60). The unit parabiaugmented dodecahedron has volume V=1/6(25+11sqrt(5)) (1) and Dehn ...

In the 1930s, Reidemeister first rigorously proved that knots exist which are distinct from the unknot. He did this by showing that all knot deformations can be reduced to a ...