An Exhaustive Search Algorithm for Finding Hamiltonian Cycles

dc.contributor.author	Zeps, Dainis
dc.date.accessioned	2013-04-23T05:57:54Z
dc.date.available	2013-04-23T05:57:54Z
dc.date.issued	1980
dc.identifier.citation	EIK 16(1-3): 69-75 (1980)	en_US
dc.identifier.issn	0013-5712
dc.identifier.uri	https://dspace.lu.lv/dspace/handle/7/1425
dc.description.abstract	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 search all palms in the graphs but only those which are not branched. Tutte's 46 vertices graph searching took less than 3 minutes on EC- 1022 computer.	en_US
dc.language.iso	rus	en_US
dc.publisher	EIK,Elektronische Informationsverarbeitung und Kybernetik, Universität Trier, Akademie Verlag	en_US
dc.relation.ispartofseries	Vol 16;Nu 1-3
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.subject	graph theory	en_US
dc.subject	hamiltonian cycle	en_US
dc.subject	depth-first search	en_US
dc.subject	palm tree	en_US
dc.title	An Exhaustive Search Algorithm for Finding Hamiltonian Cycles	en_US
dc.type	Postprint	en_US