We present a collection of algorithms which are used to construct Hamiltonian paths
and cycles in hypercube networks with faulty nodes. In graph theoretical terms, the
hypercube is a connected, undirected graph composed of edges and nodes, or...
steps required to represent the knot as a polygon in the cubic lattice. Several lower bounds for the lattice step numbers of different knots have been obtained by computer simulations but the exact value of the lattice step number seems to be ...
