Search Results for ""

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...

The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...

A bimagic cube is a (normal) magic cube that remains magic when all its elements are squared. Of course, even a normal magic cubic becomes nonnormal (i.e., contains ...

If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

The Borromean rings, also called the Borromean links (Livingston 1993, p. 10) are three mutually interlocked rings (left figure), named after the Italian Renaissance family ...

Place two solid spheres of radius 1/2 inside a hollow sphere of radius 1 so that the two smaller spheres touch each other at the center of the large sphere and are tangent to ...