{"id":"https://openalex.org/W4402644630","doi":"https://doi.org/10.15388/24-infor568","title":"Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems","display_name":"Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4402644630","doi":"https://doi.org/10.15388/24-infor568"},"language":"en","primary_location":{"id":"doi:10.15388/24-infor568","is_oa":true,"landing_page_url":"https://doi.org/10.15388/24-infor568","pdf_url":"https://informatica.vu.lt/journal/INFORMATICA/article/1346/file/pdf","source":{"id":"https://openalex.org/S57195646","display_name":"Informatica","issn_l":"0868-4952","issn":["0868-4952","1822-8844"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://informatica.vu.lt/journal/INFORMATICA/article/1346/file/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036768913","display_name":"Marta Kasprzak","orcid":"https://orcid.org/0000-0002-9863-5412"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marta Kasprzak","raw_affiliation_strings":["Institute of Computing Science , Poznan University of Technology , Piotrowo 2 , 60-965 Poznan , Poland"],"raw_orcid":"https://orcid.org/0000-0002-9863-5412","affiliations":[{"raw_affiliation_string":"Institute of Computing Science , Poznan University of Technology , Piotrowo 2 , 60-965 Poznan , Poland","institution_ids":["https://openalex.org/I46597724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036768913"],"corresponding_institution_ids":["https://openalex.org/I46597724"],"apc_list":null,"apc_paid":null,"fwci":0.6914,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73378903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"807","last_page":"816"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8184835910797119},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.7211323976516724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6415561437606812},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5665745735168457},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.56219083070755},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5608773231506348},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42785608768463135},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37952864170074463},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.24788036942481995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19418087601661682},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12703657150268555}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8184835910797119},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.7211323976516724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6415561437606812},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5665745735168457},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.56219083070755},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5608773231506348},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42785608768463135},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37952864170074463},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.24788036942481995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19418087601661682},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12703657150268555},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.15388/24-infor568","is_oa":true,"landing_page_url":"https://doi.org/10.15388/24-infor568","pdf_url":"https://informatica.vu.lt/journal/INFORMATICA/article/1346/file/pdf","source":{"id":"https://openalex.org/S57195646","display_name":"Informatica","issn_l":"0868-4952","issn":["0868-4952","1822-8844"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Informatica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.15388/24-infor568","is_oa":true,"landing_page_url":"https://doi.org/10.15388/24-infor568","pdf_url":"https://informatica.vu.lt/journal/INFORMATICA/article/1346/file/pdf","source":{"id":"https://openalex.org/S57195646","display_name":"Informatica","issn_l":"0868-4952","issn":["0868-4952","1822-8844"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Informatica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4402644630.pdf","grobid_xml":"https://content.openalex.org/works/W4402644630.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1498196328","https://openalex.org/W1975951388","https://openalex.org/W1984883238","https://openalex.org/W1993429924","https://openalex.org/W2013396468","https://openalex.org/W2038922976","https://openalex.org/W2074710925","https://openalex.org/W2089199433","https://openalex.org/W2118275860","https://openalex.org/W2120141762","https://openalex.org/W2164243805","https://openalex.org/W2550825112","https://openalex.org/W3124747858"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W4387272283","https://openalex.org/W2768859505","https://openalex.org/W2256329187","https://openalex.org/W2952856011","https://openalex.org/W2046852387","https://openalex.org/W2036803675","https://openalex.org/W2127206007","https://openalex.org/W3207048296","https://openalex.org/W2069133957"],"abstract_inverted_index":{"The":[0,55],"Hamiltonian":[1],"cycle":[2],"and":[3,11,26,71],"path":[4],"problems":[5],"are":[6,53,63],"fundamental":[7],"in":[8,13,18],"graph":[9],"theory":[10],"useful":[12],"modelling":[14,73],"real-life":[15],"problems.":[16],"Research":[17],"this":[19],"area":[20],"is":[21],"directed":[22,68],"toward":[23,34],"designing":[24],"better":[25,27],"algorithms":[28,43],"for":[29,39],"general":[30],"problems,":[31],"but":[32],"also":[33],"defining":[35],"new":[36,49],"special":[37],"cases":[38],"which":[40,62],"exact":[41],"polynomial-time":[42],"exist.":[44],"In":[45],"the":[46],"paper,":[47],"such":[48],"classes":[50,56],"of":[51,66],"digraphs":[52],"proposed.":[54],"include,":[57],"among":[58],"others,":[59],"quasi-adjoint":[60],"graphs,":[61,70],"a":[64,74],"superclass":[65],"adjoints,":[67],"line":[69],"graphs":[72],"DNA":[75],"sequencing":[76],"problem.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-09T07:00:12.390032","created_date":"2025-10-10T00:00:00"}