超越准邻接图：论哈密尔顿循环和路径问题的多项式时间可解案例

IF 3.3 4区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Informatica Pub Date : 2024-09-18 DOI:10.15388/24-infor568

Marta Kasprzak

{"title":"超越准邻接图：论哈密尔顿循环和路径问题的多项式时间可解案例","authors":"Marta Kasprzak","doi":"10.15388/24-infor568","DOIUrl":null,"url":null,"abstract":"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.\nPDF  XML","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"4 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems\",\"authors\":\"Marta Kasprzak\",\"doi\":\"10.15388/24-infor568\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\\nPDF  XML\",\"PeriodicalId\":56292,\"journal\":{\"name\":\"Informatica\",\"volume\":\"4 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.15388/24-infor568\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informatica","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.15388/24-infor568","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

哈密顿循环和路径问题是图论中的基本问题，在模拟现实问题时非常有用。该领域的研究方向是为一般问题设计出越来越好的算法，同时也为存在精确多项式时间算法的新特例定义算法。本文提出了这类新的数字图。这些类别包括准相邻图（相邻图的超类）、有向线图和 DNA 测序问题建模图等。PDF XML

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems

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. PDF XML

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Informatica 工程技术-计算机：信息系统

CiteScore

5.90

自引率

6.90%

发文量

审稿时长

12 months

期刊介绍： The quarterly journal Informatica provides an international forum for high-quality original research and publishes papers on mathematical simulation and optimization, recognition and control, programming theory and systems, automation systems and elements. Informatica provides a multidisciplinary forum for scientists and engineers involved in research and design including experts who implement and manage information systems applications.