Local algorithms for circuits in a Boolean cube (Q1842418)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Local algorithms for circuits in a Boolean cube |
scientific article; zbMATH DE number 745993
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local algorithms for circuits in a Boolean cube |
scientific article; zbMATH DE number 745993 |
Statements
Local algorithms for circuits in a Boolean cube (English)
0 references
17 May 1995
0 references
We consider a local algorithm for the construction of an Eulerian circuit in an \(n\)-dimensional binary cube. We show that no such circuit exists consisting of Hamiltonian cycles of a certain structure (Gray codes of a special form). An algorithm with space complexity \(n\) is proposed for the construction of an Eulerian circuit which is not a union of Hamiltonian cycles.
0 references
Gray codes
0 references
Eulerian circuit
0 references
\(n\)-dimensional binary cube
0 references
