Finding Hamiltonian circuits in quasi-adjoint graphs

This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothernnic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718-7291. This paper presents a class of digraphs: the quasi-adjoint graphs. This class includes the ones used in the paper cited above. A polynomial recognition algorithm in O(n(3)), as well as a polynomial algorithm in O(n(2) + m(2)) for finding a Hamiltonian circuit in these graphs are given. Furthermore, some results about related problems such as finding a Eulerian circuit while respecting some forbidden transitions (a path with three vertices) are discussed. (c) 2008 Elsevier B.V. All rights reserved.


Published in:
Discrete Applied Mathematics, 156, 2573-2580
Presented at:
5th International Conference on Graphs and Optimization, Leukerbad, SWITZERLAND, Aug, 2006
Year:
2008
Keywords:
Laboratories:




 Record created 2010-11-30, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)