Every Eulerian path constitutes a node in a graph. By what set of operators may these Eulerian paths be organised into a graph such that one may compute upon that graph all possible Hamiltonian paths over that set of Eulerian paths? We suggest the method of de Bruijn sequence rotation as a means to construct such Hamiltonian paths.

More William R. Buckley's questions See All
Similar questions and discussions