Search
Now showing items 1-2 of 2
Kā mācīties (senās) valodas
(1988)
Author tells about his experience of learning of some ancient languages. Author introduces a notion the road starting paradigm in order to help for a student of ancient language to start to organize his/her study tools ...
An Exhaustive Search Algorithm for Finding Hamiltonian Cycles
(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 ...