Zeps, Dainis(EIK,Elektronische Informationsverarbeitung und Kybernetik, Universität Trier, Akademie Verlag, 1980)
The paper suggests an exhaustive search algorithm for finding
Hamiltonian circuits in an undirected graph based on depth-first
search and working successfully on sparse graphs. The method is
based on the idea not to ...