Rights / licenseIn Copyright - Non-Commercial Use Permitted
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representation, and presented it for dimension 4. We classify cycles in two further dimensions using a reduction to propositional SAT. Our proposed algorithm starts with an over-approximation of the set of equivalence classes, which is then refined using queries to a SAT-solver to remove spurious cycles. Our method performs up to three orders of magnitude faster than an enumeration with symmetry breaking in the 5-cube Show more
Journal / seriesTechnical report / ETH Zurich, Department of Computer Science
PublisherETH, Eidgenössische Technische Hochschule Zürich, Department of Computer Science
SubjectZYKLEN (GRAPHENTHEORIE); Bitonic sorting network; CYCLES (GRAPH THEORY); Hypercube; Aymmetry breaking; GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); Code equivalence; Gray code; Hamiltonian cycle; SAT-solver; HYPERGRAPHEN (GRAPHENTHEORIE); GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY); HYPERGRAPHS (GRAPH THEORY)
Organisational unit02150 - Departement Informatik / Department of Computer Science
NotesTechnical Reports D-INFK.
MoreShow all metadata