THE HAMILTON CIRCUIT PROBLEM ON GRIDS

AFRATI, F

dc.contributor.author	AFRATI, F	en
dc.date.accessioned	2014-03-01T01:10:21Z
dc.date.available	2014-03-01T01:10:21Z
dc.date.issued	1994	en
dc.identifier.issn	0988-3754	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11381
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/journals/ita/ita28.html#Afrati94	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.other	ALGORITHMS	en
dc.subject.other	GRAPHS	en
dc.title	THE HAMILTON CIRCUIT PROBLEM ON GRIDS	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1994	en
heal.abstract	This paper investigates the Hamilton circuit problem on grid graphs. For general grid graphs it is known to be NP-complete. We consider a non-trivial subclass of grid graphs and present a linear algorithm for finding a Hamilton circuit. Moreover, we show that our algorithm can be optimally parallelized, hence the problem belongs to NC.	en
heal.publisher	DUNOD	en
heal.journalName	RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS	en
dc.identifier.isi	ISI:A1994PW71800003	en
dc.identifier.volume	28	en
dc.identifier.issue	6	en
dc.identifier.spage	567	en
dc.identifier.epage	582	en