Hamiltonian problems for reducible flowgraphs

Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2585

Full metadata record

DC Field	Value	Language
dc.contributor.author	Pires, Oswaldo Vernet de Souza	-
dc.contributor.author	Markenzon, Lilian	-
dc.date.accessioned	2017-08-04T12:24:58Z	-
dc.date.available	2023-12-21T03:02:42Z	-
dc.date.issued	1997-12-31	-
dc.identifier.citation	VERNET, O.; MARKENZON, L. Hamiltonian problems for reducible flowgraphs. Rio de Janeiro: NCE, UFRJ, 1997. 7 p. (Relatório Técnico, 05/97)	pt_BR
dc.identifier.uri	http://hdl.handle.net/11422/2585	-
dc.description.abstract	In this paper, we discuss hamiltonian problems for reducible flowgraphs. The main result is finding, in linear time, the unique hamiltonian cycle, if it exists. In order to obtain this result, two other related problems are solved: finding the hamiltonian path starting at the source vertex and finding the hamiltonian cycle given the hamiltonian path.	pt_BR
dc.language	eng	pt_BR
dc.relation.ispartof	Relatório Técnico NCE	pt_BR
dc.rights	Acesso Aberto	pt_BR
dc.subject	Sistemas hamiltonianos	pt_BR
dc.subject	Flowgraphs	en
dc.subject	Hamiltonian paths	en
dc.subject	Hamiltonian cycles	en
dc.title	Hamiltonian problems for reducible flowgraphs	en
dc.type	Relatório	pt_BR
dc.publisher.country	Brasil	pt_BR
dc.publisher.department	Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais	pt_BR
dc.subject.cnpq	CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::MATEMATICA DA COMPUTACAO	pt_BR
dc.citation.issue	0297	pt_BR
dc.embargo.terms	aberto	pt_BR
Appears in Collections:	Relatórios

Files in This Item:

File	Description	Size	Format
02_97_000575787.pdf		360.74 kB	Adobe PDF	View/Open

Pantheon Institutional repository