On the parallel complexity of the alternating Hamiltonian cycle problem

Bampis, E; Manoussakis, Y; Milis, I

dc.contributor.author	Bampis, E	en
dc.contributor.author	Manoussakis, Y	en
dc.contributor.author	Milis, I	en
dc.date.accessioned	2014-03-01T01:48:41Z
dc.date.available	2014-03-01T01:48:41Z
dc.date.issued	1999	en
dc.identifier.issn	03990559	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25556
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0348193530&partnerID=40&md5=86d7c57e78fee46d3851600f7d1241fa	en
dc.title	On the parallel complexity of the alternating Hamiltonian cycle problem	en
heal.type	journalArticle	en
heal.publicationDate	1999	en
heal.abstract	Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges differ in color. The problem of finding such a cycle, even for 2-edge-colored graphs, is trivially NP-complete, while it is known to be polynomial for 2-edge-colored complete graphs. In this paper we study the parallel complexity of finding such a cycle, if any, in 2-edge-colored complete graphs. We give a new characterization for such a graph admitting an alternating Hamiltonian cycle which allows us to derive a parallel algorithm for the problem. Our parallel solution uses a perfect matching algorithm putting the alternating Hamiltonian cycle problem to the RNC class. In addition, a sequential version of our parallel algorithm improves the computation time of the fastest known sequential algorithm for the alternating Hamiltonian cycle problem by a factor of O(√n).	en
heal.journalName	RAIRO Recherche Operationnelle	en
dc.identifier.volume	33	en
dc.identifier.issue	4	en
dc.identifier.spage	421	en
dc.identifier.epage	437	en