Skip to content
#

linear-complexity

Here are 5 public repositories matching this topic...

Language: All
Filter by language

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

  • Updated Jul 23, 2024
  • Rust

Improve this page

Add a description, image, and links to the linear-complexity topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the linear-complexity topic, visit your repo's landing page and select "manage topics."

Learn more