{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T05:15:18Z","timestamp":1733375718019,"version":"3.30.1"},"reference-count":19,"publisher":"Vilnius University Press","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:p>The Hamiltonian cycle and path problems are fundamental in graph theory and useful in modelling real-life problems. Research in this area is directed toward designing better and better algorithms for general problems, but also toward defining new special cases for which exact polynomial-time algorithms exist. In the paper, such new classes of digraphs are proposed. The classes include, among others, quasi-adjoint graphs, which are a superclass of adjoints, directed line graphs, and graphs modelling a DNA sequencing problem.<\/jats:p>","DOI":"10.15388\/24-infor568","type":"journal-article","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T12:34:53Z","timestamp":1726749293000},"page":"807-816","source":"Crossref","is-referenced-by-count":0,"title":["Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems"],"prefix":"10.15388","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9863-5412","authenticated-orcid":false,"given":"Marta","family":"Kasprzak","sequence":"first","affiliation":[]}],"member":"6097","published-online":{"date-parts":[[2024,9,18]]},"reference":[{"key":"2024120408520648684_j_infor568_ref_001","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(99)00064-5","article-title":"On the complexity of Hamiltonian path and cycle problems in certain classes of digraphs","volume":"95","year":"1999","journal-title":"Discrete Applied Mathematics"},{"volume-title":"Digraphs. Theory, Algorithms and Applications","year":"2002","key":"2024120408520648684_j_infor568_ref_002"},{"volume-title":"Graphs and Hypergraphs","year":"1973","key":"2024120408520648684_j_infor568_ref_003"},{"issue":"4\u20135","key":"2024120408520648684_j_infor568_ref_004","first-page":"157","article-title":"The edge Hamiltonian path problem is NP-complete","volume":"13","year":"1981","journal-title":"Information Processing Letters"},{"issue":"1","key":"2024120408520648684_j_infor568_ref_005","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/110839229","article-title":"Determinant sums for undirected hamiltonicity","volume":"43","year":"2014","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"2024120408520648684_j_infor568_ref_006","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.dam.2005.05.028","article-title":"Computational complexity of isothermic DNA sequencing by hybridization","volume":"154","year":"2006","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"2024120408520648684_j_infor568_ref_007","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-2012-711","article-title":"Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem","volume":"118","year":"2012","journal-title":"Fundamenta Informaticae"},{"issue":"1\u20132","key":"2024120408520648684_j_infor568_ref_008","first-page":"1","article-title":"On some properties of DNA graphs","volume":"98","year":"1999","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"2024120408520648684_j_infor568_ref_009","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.dam.2003.09.006","article-title":"Sequencing by hybridization with isothermic oligonucleotide libraries","volume":"145","year":"2004","journal-title":"Discrete Applied Mathematics"},{"issue":"13","key":"2024120408520648684_j_infor568_ref_010","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1016\/j.dam.2008.03.014","article-title":"Finding Hamiltonian circuits in quasi-adjoint graphs","volume":"156","year":"2008","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"2024120408520648684_j_infor568_ref_011","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(86)90141-X","article-title":"A sufficient condition for oriented graphs to be Hamiltonian","volume":"58","year":"1986","journal-title":"Discrete Mathematics"},{"volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","year":"1979","key":"2024120408520648684_j_infor568_ref_012"},{"issue":"2","key":"2024120408520648684_j_infor568_ref_013","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jgt.3190150204","article-title":"Updating the Hamiltonian problem \u2013 a survey","volume":"15","year":"1991","journal-title":"Journal of Graph Theory"},{"edition":"second edition","volume-title":"Handbook of Graph Theory","year":"2013","key":"2024120408520648684_j_infor568_ref_014"},{"key":"2024120408520648684_j_infor568_ref_015","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1613\/jair.3109","article-title":"An effective algorithm for and phase transitions of the directed Hamiltonian cycle problem","volume":"39","year":"2010","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2024120408520648684_j_infor568_ref_016","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.dam.2016.10.014","article-title":"Classification of de Bruijn-based labeled digraphs","volume":"234","year":"2018","journal-title":"Discrete Applied Mathematics"},{"issue":"12","key":"2024120408520648684_j_infor568_ref_017","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1016\/S0031-8914(63)80241-4","article-title":"A soluble self-avoiding walk problem","volume":"29","year":"1963","journal-title":"Physica"},{"volume-title":"Combinatorial Optimization: Networks and Matroids","year":"1976","key":"2024120408520648684_j_infor568_ref_018"},{"issue":"12","key":"2024120408520648684_j_infor568_ref_019","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1093\/bioinformatics\/btab005","article-title":"Genome-scale de novo assembly using ALGA","volume":"37","year":"2021","journal-title":"Bioinformatics"}],"container-title":["Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1346\/text","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1346\/text","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T07:04:36Z","timestamp":1733295876000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/24-INFOR568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":19,"alternative-id":["10.15388\/24-INFOR568"],"URL":"https:\/\/doi.org\/10.15388\/24-infor568","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"type":"print","value":"0868-4952"},{"type":"electronic","value":"1822-8844"}],"subject":[],"published":{"date-parts":[[2024]]}}}