Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...
rust
graph-algorithms
loops
discrete-mathematics
grids
sculpture
hamiltonian-cycle
graph-theory-algorithms
optmization
np-complete-problems
linear-complexity
3d-grid
3d-lattice
-
Updated
Jul 18, 2023 - Rust